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]: [[-38, 56, -23], [-19, -178, -59]]
[EX A]: [56, -19]

[EX Q]: [[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]
[EX A]: [95, 58, 72, 99, 80, 89, -18, -25]

[EX Q]: [[68, -42, 21], [28, 6], [-148, -45], [-191, -195, -76, -13], [44, -148, -31, -71, -134], [-125, 93, 46, 71, 15], [98, -19, 44, -76, -118]]
[EX A]:
[68, 28, -45, -13, 44, 93, 98]