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]: [[99, 11, 61, -95], [-186, -124, -20, -125], [-50, 93, -17], [-165, 56, 52, -142], [-88, -46, -178, -37, -126, 24], [84, 100, 18, 71, -135, 44, 96]]
[EX A]: [99, -20, 93, 56, 24, 100]

[EX Q]: [[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]
[EX A]: [93, -40, -72, 13, 91, 35, 33, 28]

[EX Q]: [[-129, 2, 64, 58, 83, -189, -56], [77, -56, -26], [85, -189, -174, -32, -161], [-67, 32], [84, 82, -119, -88, -54], [-170, -44, 65, -171], [99, -101, 57, -162], [-169, -162, 46, -127, -80, -143, -81]]
[EX A]:
[83, 77, 85, 32, 84, 65, 99, 46]