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]: [[77, -129, -165, -23, -25, 84], [-148, -184, -130, -48, 66], [12, -10, -184, -198, -76], [-15, -102, 62, 49], [32, -91]]
[A]: [84, 66, 12, 62, 32]


[Q]: [[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]
[A]: [63, -33, 43, 68]


[Q]: [[-115, 62, 79, -36, 83, -124, -115], [-117, -90, -8, -127], [-26, -175, 78, 13, 73]]
[A]:
[83, -8, 78]