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]: [[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]
[A]: [96, 48, 65, 19, -26, 95, -11]


[Q]: [[-161, 54], [-41, 74], [74, 84, -87, 28, -181], [-44, 9, 40, -67, -193]]
[A]: [54, 74, 84, 40]


[Q]: [[-26, 58], [-187, -69, -9, 33, -112, -125, -6], [-10, 35, 67], [-183, -113, 79, -179, -49, -3, 68], [39, -93, -162, -200, -183]]
[A]:
[58, 33, 67, 79, 39]