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]: [[-49, -181, -26, -69], [-2, 61, -87, 2, -166, -161]]
[A]: [-26, 61]


[Q]: [[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]
[A]: [95, 58, 72, 99, 80, 89, -18, -25]


[Q]: [[16, 8, 48, 100, 89, -190], [-26, -55, -125, -32, -18], [-153, -171], [-110, 59, 2], [7, -126, -193], [-27, -195, 4, 41], [-53, 87, -110, -131]]
[A]:
[100, -18, -153, 59, 7, 41, 87]