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]: [[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]
[EX A]: [-111, 83, -8, 92, 55, 91, 70]

[EX Q]: [[70, -27, -68, 73, 60, 41], [98, -117, -181, -143], [-67, -73, -21]]
[EX A]:
[73, 98, -21]