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]: [[-88, -51, -196, 52, 31], [-40, -25, -38, -72], [-113, 74], [-1, 91, -198], [52, -61, -60], [-30, 70, -10, 98, -62, -60, -37], [-64, -40, -59, -13, -94, -57], [-194, -70, 95, 81, 7, 47]]
[EX A]: [52, -25, 74, 91, 52, 98, -13, 95]

[EX Q]: [[-61, -173, -114, -165, -42], [88, 66], [-180, -162, 19, -92, 91, -102, -166], [-98, -156, -21, -13], [34, -133, -111]]
[EX A]: [-42, 88, 91, -13, 34]

[EX Q]: [[-92, 48, -21, -63, -107], [-8, 56, 22, -149, -86, -100, -72]]
[EX A]:
[48, 56]