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]: [[-110, -122, -29], [-125, 57, 69], [1, -181, -129, -60, -67], [-172, -26, -65, -102, -124, 54], [52, -39, -177]]
[EX A]: [-29, 69, 1, 54, 52]

[EX Q]: [[76, -83, -46], [3, 41, -151, -14, -59], [73, 90, -134, 22], [1, -181, -112, -177, 32, -93], [-142, -184, 39, -5]]
[EX A]: [76, 41, 90, 32, 39]

[EX Q]: [[84, -7, 83, -54, -64, 78], [-30, 38], [-157, -38, -16, 43], [-79, 40, 73, -90, -188, -61, -145], [-17, -55, -125], [-14, -96, 84]]
[EX A]:
[84, 38, 43, 73, -17, 84]