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.

[Q]: [[-194, -30, -77, -21], [35, 86], [-189, -19, 29, -169, -32, -38, -25], [100, -144, 85]]
[A]: [-21, 86, 29, 100]


[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]]
[A]: [87, 98, 50, -118, -43, 80, -100]


[Q]: [[27, -37, -4, 71, -137], [-34, -93, -148, -195]]
[A]:
[71, -34]