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]: [[-127, 43, -163, -34, -6], [11, -75, -155, -25, 7, -180, -37], [-192, 11, -104, -54], [58, -177], [-59, -138, 2, 21, -33, -194, -135], [100, -111, -180, 15, 22], [-74, -116, 25, -117]]
[A]: [43, 11, 11, 58, 21, 100, 25]


[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]: [[95, -161, -147], [8, -84, 17, -190, -181, -35], [-63, -48, -136, 56], [-185, -78, 84], [75, -144, -167, -143, 18]]
[A]:
[95, 17, 56, 84, 75]