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]: [[-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]: [[-169, -104, 48, -186, 57, -108], [-36, 65, -62, -91, 58, 55, -136], [-107, -18], [-52, -153, 45, -119, -105, 18], [65, 58, -15, -79, 82, -93], [-178, 96, -64], [44, -116, -197, -109, -15], [-161, 23, -115, -148, -175, -189, -175]]
[EX A]: [57, 65, -18, 45, 82, 96, 44, 23]

[EX Q]: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]
[EX A]:
[75, 57, 75, 20, -95, 20]