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]: [[-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]: [[-19, -31, -126], [-24, -137, -129], [-126, 93, -32, 79, -145, -152], [-200, -55], [-194, 52, -67, -77, 15, -186, -158], [92, 62, -44, 90, -168, 96, -193], [-22, -125]]
[A]: [-19, -24, 93, -55, 52, 96, -22]


[Q]: [[34, 1, -33], [53, -160, -60], [30, -52], [1, 84, -90, -29, -196], [-28, -44, -4, -39], [-44, -165, -190, -114, 86, -6, 77], [-176, 47, 53, 87], [-197, -148], [-127, -120, -66, -192, 12, -32]]
[A]:
[34, 53, 30, 84, -4, 86, 87, -148, 12]