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.

[EX Q]: [[-149, 97, 37, -156], [-179, -55, -35, -109], [-64, -190, 7, -6, -4, -96, -149]]
[EX A]: [97, -35, 7]

[EX Q]: [[-2, -59, -139, -19, -120], [-148, 59, 73, -148, 27], [94, -73, -135, 45, -75, 23], [81, -132, 2, -132, 49]]
[EX A]: [-2, 73, 94, 81]

[EX Q]: [[66, -23, 87, -114, -120, -25, -127], [51, 92, 24, 8, -166], [73, 49, 30, -76, 48], [-53, -51, -5, 1, 15, -186, -106], [-23, -129, 50, 73, -131, -150, 87], [-97, -104], [-192, 57]]
[EX A]:
[87, 92, 73, 15, 87, -97, 57]