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]: [[-124, -72, 94], [40, -5, -15, -98, 79, -94, -45], [53, -40, -73, -117, -195, -50], [20, 51, -140], [-30, -112, 25, 35, 84], [-40, -135, -184, -159, -33, -59]]
[EX A]: [94, 79, 53, 51, 84, -33]

[EX Q]: [[-161, 54], [-41, 74], [74, 84, -87, 28, -181], [-44, 9, 40, -67, -193]]
[EX A]: [54, 74, 84, 40]

[EX Q]: [[-55, 47, -2, -189, 56, -79, -20], [-87, -199, -122, -151, -6, -19], [88, -94, 54, -40, -76, -135, -69], [-95, -140, 64, -192, -185, 43], [-109, 94, -55, -187, -93, -66, -158]]
[EX A]:
[56, -6, 88, 64, 94]