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]: [[-40, -40, 89, -120, 33], [-157, -13, 7, 45], [35, -131, 87, -23], [-125, 77, 68, -106, -2], [89, -90, 15, -2, 42, -95, 72], [-4, -179], [-119, -79], [41, -12, -110]]
[EX A]: [89, 45, 87, 77, 89, -4, -79, 41]

[EX Q]: [[-26, 54, 36], [-50, 30, -14], [-156, -199, 52, -83, 10], [-97, -59], [-14, 5, -188, -55, 74, -190], [43, -5, 14, 28, -77, -186, -74], [-200, -151], [-162, 64]]
[EX A]: [54, 30, 52, -59, 74, 43, -151, 64]

[EX Q]: [[-167, -149, 66, 9], [20, -65, -181, -163, -193, -134], [-157, 61], [-43, -64, -122, -74, 23, -181, 24], [62, 51, -59, -119, -167]]
[EX A]:
[66, 20, 61, 24, 62]