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]: [[-20, -106, -178, 55], [-140, -84, -171, -91]]
[A]: [55, -84]

[Q]: [[-40, 4, -3, -194, -125], [95, 1, 18, -58, -130, -124, -150], [-128, 28, -80, -152, -186], [51, -199], [-75, -172, -90, -149, -142], [-137, 76, 47, 70], [-58, 64, 4, -194, -169, -16, -107], [9, -57]]
[A]: [4, 95, 28, 51, -75, 76, 64, 9]

[Q]: [[-159, -163, 88], [-155, -101, 7, 3, -68], [-159, -150, -122, -71, -77, -102, 71], [-181, -3, -156, 33, 34, -197, 13], [-61, -32, -101, 89, 19, -73], [-1, 7, -77, 21, -199], [13, -25, -112, -38], [-163, -69, 22, 78, 48, 60]]
[A]:
[88, 7, 71, 34, 89, 21, 13, 78]