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]: [[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]
[EX A]: [53, 34, 91, 40]

[EX Q]: [[-176, 36, 94, 7, 55, 29], [-66, 24, -23, -199, -43, -40], [-99, -187, -132, -129, 12]]
[EX A]: [94, 24, 12]

[EX Q]: [[28, -96, -172, -111, -47, -57], [-125, 37, -37, -200, -53, 46], [-121, 6, -71, -98, -195, 95, 10], [-52, -181, -14, 34], [-30, 35, -32, -18, -159, -68, -25], [-165, -73, -162, -163, 48], [-99, -37]]
[EX A]:
[28, 46, 95, 34, 35, 48, -37]