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]: [[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]
[EX A]: [35, -69, -81, 92, 91, 58, 48, -41]

[EX Q]: [[-2, -59, -139, -19, -120], [-148, 59, 73, -148, 27], [94, -73, -135, 45, -75, 23], [81, -132, 2, -132, 49]]
[EX A]: [-2, 73, 94, 81]

[EX Q]: [[14, -35, 9], [38, 29], [19, -10, 26, 38], [51, 52, -153, 44, 27, 14], [-41, -177, 85, -8, -180], [-136, -199, -108], [-196, -26, -41, 64], [-135, 3, -121, 82, 31], [-148, -63, 26, -129, -93, -140, -129]]
[EX A]:
[14, 38, 38, 52, 85, -108, 64, 82, 26]