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]: [[-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]: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]
[EX A]: [100, 84, -63, -55, 78, 58, 86, 99]

[EX Q]: [[-103, 72, -19], [93, -51], [-63, 30], [-14, -161, -125, -133], [-162, -107], [-99, 92, -79, -130, 72], [-108, 98, -15, 11, 1, 0, 31], [-14, -17, -163, 5, -117], [-38, 48, -114, 96, -169]]
[EX A]:
[72, 93, 30, -14, -107, 92, 98, 5, 96]