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]: [[6, -22, -195, 87], [-198, 60, 87, 19, 98, -147, 94], [-62, 50], [-159, -118, -193], [-165, -176, -157, -43, -121, -73], [32, 51, -24, -37, 80], [-110, -100, -198, -145]]
[EX A]: [87, 98, 50, -118, -43, 80, -100]

[EX Q]: [[95, -34, -73, 46, 51, -185, -192], [-43, -56, -90, -52], [59, 91], [90, 18, 33, -33, -62, -52]]
[EX A]: [95, -43, 91, 90]

[EX Q]: [[-20, -46, -173], [-18, -73, 89, 90], [-193, -171, -57, -138]]
[EX A]:
[-20, 90, -57]