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]: [[20, 71, -57, -136, 45], [-3, -147, -182], [48, -161, 35, -16, -193], [7, 90, -78, -102], [-108, 92, 30, -147, -86, -132]]
[EX A]: [71, -3, 48, 90, 92]

[EX Q]: [[-187, -52, -138, 33], [-32, -176, -198, -74, 66], [95, -187, 82, -51, -114]]
[EX A]: [33, 66, 95]

[EX Q]: [[-5, 57], [87, -24, -155, 0], [59, -16, -146, -75, -49, 98, 76], [-52, 75, -96], [38, 98, -153], [-170, -81, -33, 63], [-140, 36, -174, -179, -134, -54, 47], [-103, -47, -2, 72, -133, -87]]
[EX A]:
[57, 87, 98, 75, 98, 63, 47, 72]