In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.

[Q]: [[-56, 1, 91, 72, -43, 93, 97], [82, -37, 68, 90, -1], [-77, -107, -45, -85, 93], [48, -60, -115, -121, 52, -56, -173], [-75, -154, 52, -51, -70], [-133, -87, -29, -183, -168], [37, -115, -149, -51], [-168, -135, 79], [-46, 13, 24, -91, -91, 80]]
[A]: [97, 90, 93, 52, 52, -29, 37, 79, 80]


[Q]: [[-56, -17, -187], [-135, -22, 5], [41, -132, -73, -106, -40], [4, -165, -9, -32, -167, -112], [-73, -120, -55, -46, -49, -71], [80, -199, -188, 25, -12, 7], [-22, -124, -193, 28, 92, 27], [-183, -80, 7, -156, 65], [61, -127, -144, -99, -195, 69]]
[A]: [-17, 5, 41, 4, -46, 80, 92, 65, 69]


[Q]: [[-34, 6, -29, 63, -72], [-19, 16, 17], [47, 9, -82, 5, -9], [-47, -147, 86]]
[A]:
[63, 17, 47, 86]