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]: [[-103, 16, -53, -29, -31, -137, -190], [-87, -195, -34, 13], [97, -68], [-67, 8, -100, -197, 19], [-76, 36, 24, -166, 20, 11], [-173, 10], [60, 8, -56]]
[EX A]: [16, 13, 97, 19, 36, 10, 60]

[EX Q]: [[87, -106], [-158, -75, -142, -192, -94], [-15, -17, -192]]
[EX A]:
[87, -75, -15]