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]: [[93, 55, 18, 28, -87, -59], [-181, 6, -163, -78, 17], [70, -41, 36, 78, 67, -180], [-180, 84, 59], [-155, 35]]
[EX A]: [93, 17, 78, 84, 35]

[EX Q]: [[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]
[EX A]: [27, -10, 40, 78, 74, 22, 51]

[EX Q]: [[60, -30, 48, -107], [69, -6, -58, -22], [51, -46, 67, -100, -29, -170, -10], [-143, -183, 5]]
[EX A]:
[60, 69, 67, 5]