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]: [[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]
[EX A]: [99, 68, -32]

[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]: [[-41, -35, -126, -116], [98, -5], [-47, 64, 0, 32, -157, 97, -177], [84, -121, 31, -162, -94, 35, -76], [-68, -160, -120, -139, -184, -52], [-139, 20, -113, -198], [-198, -108, -11, -158, 85, 3, -184]]
[EX A]:
[-35, 98, 97, 84, -52, 20, 85]