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]: [[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]
[EX A]: [60, 26, 61, 74, -28]

[EX Q]: [[-68, -107, -111, -52, -133, 80], [-150, 54, 88, -69, 6], [84, -113, 35, -189, -49, -77, 19], [99, -97, -161, 61, -66, -73, 18], [34, -141]]
[EX A]: [80, 88, 84, 99, 34]

[EX Q]: [[10, -106, -3, -187, 63, -117], [-44, 97, -3, -60, 17, 82], [63, -122, 46, -79], [-45, -146, -185, 47], [-78, -36, -46, 76, -50, 68], [-149, -17, -181, -100, 15, -26]]
[EX A]:
[63, 97, 63, 47, 76, 15]