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]: [[-195, 0], [42, 19, -7], [-155, -76, -83], [-144, 19, 88], [-139, -174, -137, 59]]
[EX A]: [0, 42, -76, 88, 59]

[EX Q]: [[-195, 93, 71, -124, 21, -20, 92], [-58, -185, 7, -57, -20, -64], [-19, -117, 60, -165, 31]]
[EX A]: [93, 7, 60]

[EX Q]: [[-93, -61, -107, 90, -86, -9, -108], [0, -177, 31, 26], [-55, -81, 54], [-196, -8], [-54, 55, -197, -19, 81, -69, -187], [40, -11, -140, -86], [36, -18], [-71, -189, -119, -187, -150, -58]]
[EX A]:
[90, 31, 54, -8, 81, 40, 36, -58]