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]: [[-4, 11], [12, -196, -120, 66, -157, -72]]
[EX A]: [11, 66]

[EX Q]: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]
[EX A]: [17, 85, 20, 70, 12, 73, 90, 59, 58]

[EX Q]: [[-82, -39, 97, -145], [-150, 22, -171, -180, -165], [-29, 41, -87, -123], [24, -5, -1], [-21, -125], [-198, -19, 91]]
[EX A]:
[97, 22, 41, 24, -21, 91]