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]: [[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]
[A]: [54, 44, 50, 12, 24, -28]


[Q]: [[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]
[A]: [99, 68, -32]


[Q]: [[66, -127, -167], [48, -102, 60, -127, -158, 46], [-175, -141, 40], [-20, 13, 82, 13], [52, -102, 40, -106], [-181, -73, -48, 23, -96], [-61, -159, 73, -110, -65], [-107, 28, 78, -180], [-195, 85, 21, -199, 32]]
[A]:
[66, 60, 40, 82, 52, 23, 73, 78, 85]