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]: [[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]
[EX A]: [86, 23, 78, 68, -116, 72, 55, 53]

[EX Q]: [[-35, 83, -145, -47, -160, -105], [-174, -29, 64, -182, 87, 53, -148], [8, -178, 46, 54], [-46, -140, -18], [-42, 51, -72], [-61, -17, -13, -52, -161]]
[EX A]: [83, 87, 54, -18, 51, -13]

[EX Q]: [[60, -60, 19, -95, -172], [-23, 21, 11], [-5, -145, -20, -153, -200], [-13, 45, -76, 27], [-104, 87], [-77, -12, -135, -71], [-81, -17, 81, -140, -78, 33], [-169, -140]]
[EX A]:
[60, 21, -5, 45, 87, -12, 81, -140]