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]: [[-78, 45], [-124, 37, 96, 43], [-24, -6, -137], [-99, -191, -101, -52], [-9, -100, -193, 24, -31, -112]]
[EX A]: [45, 96, -6, -52, 24]

[EX Q]: [[-124, -72, 94], [40, -5, -15, -98, 79, -94, -45], [53, -40, -73, -117, -195, -50], [20, 51, -140], [-30, -112, 25, 35, 84], [-40, -135, -184, -159, -33, -59]]
[EX A]: [94, 79, 53, 51, 84, -33]

[EX Q]: [[-70, -48, -127], [93, -48, -119, -32, -2, -119, -199], [43, -4, -116, 53, -141], [74, -80, -106], [-73, -194, -1, -58, 98]]
[EX A]:
[-48, 93, 53, 74, 98]