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]: [[31, 44], [13, -22, 72, 55, -34], [-27, 78, 59, 91, -145], [14, -162, -184, -161, -77, -168, -99], [-136, 28, 56, -45, 85], [-29, -101, 59, 6, 99, -113], [81, 42, -55]]
[EX A]: [44, 72, 91, 14, 85, 99, 81]

[EX Q]: [[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]
[EX A]: [98, 79, 97, 65, 71, 43, -72]

[EX Q]: [[20, 2, 11, -88, 71], [87, 43, 100, 49, -12, -172], [-60, -20]]
[EX A]:
[71, 100, -20]