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, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]
[EX A]: [53, 41, 80, 98, 91, 62]

[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]: [[-177, -7, 5, -198], [-111, 73], [-147, 40, 35, -34, 19, 30], [42, -121, -69, -186, -17]]
[EX A]:
[5, 73, 40, 42]