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]: [[-54, -127, -178, -98], [7, 82, 69], [-159, -142, -82, -156, -100, 7], [-76, 88, -45, 41], [86, -169]]
[A]: [-54, 82, 7, 88, 86]


[Q]: [[-112, 75, -10, -77, 14, -139], [-1, -78, -187, -19, -128], [-9, 31, -134, 46], [50, 88, 86, -85], [74, -188, 36, -159, -73, -75], [-20, 50], [87, -75]]
[A]:
[75, -1, 46, 88, 74, 50, 87]