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]: [[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]
[EX A]: [65, 53, 72, -30, 85, 38]

[EX Q]: [[-191, -87, 9, -89], [-198, 70, 58, 8], [-192, -60], [-50, 57, 34, -101]]
[EX A]:
[9, 70, -60, 57]