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]: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]
[EX A]: [2, 72, 60]

[EX Q]: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]
[EX A]: [95, 60, 31, -122, 66, 84, 17]

[EX Q]: [[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]
[EX A]:
[89, 96, -69, 40, 90, 75, 99, 98, 41]