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]: [[30, -72, 78, 12, -87, -118, 40], [-139, 17, 10, -139, -120, 53, -127], [-122, 28, -161, 93, 9, -171], [-195, 86, -34, 15, 73], [-71, -31, -147, -106]]
[EX A]: [78, 53, 93, 86, -31]

[EX Q]: [[-79, -50, -49, 57, -110, -78, -180], [-119, -90, 40], [81, -55, -64, -19], [17, -42, -76, -136, -58], [-74, 4, -161, -72]]
[EX A]: [57, 40, 81, 17, 4]

[EX Q]: [[-53, 63, 34, -40, 25], [-176, -86, 89, -117], [-30, -193]]
[EX A]:
[63, 89, -30]