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]: [[43, -158, 27, -169, -144, 35], [-73, -173]]
[A]: [43, -73]


[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]: [[-48, 15, -122], [-156, 52, -119, 61, -49], [-152, -142, 32, -119, 83, -85, -145], [53, -179], [75, -132, 23, -174], [8, -200], [-89, 77, 24, -64, -43], [-38, 99, 90, -186, -166]]
[A]:
[15, 61, 83, 53, 75, 8, 77, 99]