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]: [[-129, -155], [-197, -113, -8, -126, -172], [85, -141, -164, -98, 36]]
[EX A]: [-129, -8, 85]

[EX Q]: [[-61, -173, -114, -165, -42], [88, 66], [-180, -162, 19, -92, 91, -102, -166], [-98, -156, -21, -13], [34, -133, -111]]
[EX A]: [-42, 88, 91, -13, 34]

[EX Q]: [[-8, 4, -190, 89, 34, -65, -198], [8, -96, 94, -24, 29, -20, -157]]
[EX A]:
[89, 94]