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]: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]
[EX A]: [75, 51, 10, 53, -43, 17, -111]

[EX Q]: [[94, -84, 82, -92, -55], [-10, -114]]
[EX A]:
[94, -10]