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]: [[15, -109, -144], [-76, 24, -172]]
[EX A]: [15, 24]

[EX Q]: [[-123, -64, -37, -55], [-170, -193, 73, 94], [-21, -159, -100], [-59, -193, -156, 76], [21, -147, -140, -165, 85, -14], [-51, 57, 85, 1, -69, 93], [-156, -17, 72], [-48, -165, -96, -148, 5, -147], [-81, -55, 87, -12, -9]]
[EX A]: [-37, 94, -21, 76, 85, 93, 72, 5, 87]

[EX Q]: [[-35, 34, -95, -20], [89, -148, 44], [-71, -106, 22, -192], [-35, -18, 69, 58, -141]]
[EX A]:
[34, 89, 22, 69]