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]: [[-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]: [[4, -119, -5, 16, -97], [-189, 64, 89, 8]]
[EX A]: [16, 89]

[EX Q]: [[15, -178, 42, -102, -16, 53, -178], [-200, -22, -96, 84, 39], [-79, 39, -109, -85, 50, -114], [30, -58, -97, 80, -127, -65], [25, 14, -45, -133, -200, 55], [-200, -94, 83, -64, -84, 81], [-6, -137, -196, -71], [-102, 34]]
[EX A]:
[53, 84, 50, 80, 55, 83, -6, 34]