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]: [[-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]: [[91, -34, 63], [10, -130, 82, 21, 45], [-115, 18, -41, -36, -96], [-147, 46, -124, -139], [-173, -23, 37, -171, -65, -21, -42], [-191, -172, -147, 17, -27, -124], [19, 46], [-46, -174, 74]]
[EX A]: [91, 82, 18, 46, 37, 17, 46, 74]

[EX Q]: [[46, -118], [-189, -80], [-85, -87, -90], [6, 82, -152, -196], [-4, -39, -176, -172, -50, -129, -173], [-81, 39], [-4, -45, -11, 52, -28, 84]]
[EX A]:
[46, -80, -85, 82, -4, 39, 84]