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]: [[-21, -117, 34], [-98, -30], [-138, 37, -165], [31, 55, -180, -96], [-5, 85, -58], [-180, 61]]
[A]: [34, -30, 37, 55, 85, 61]


[Q]: [[35, -101, 13, 4, -151, 87], [50, 52, -34, -161], [-184, -19, -4, -152], [82, 30, -168, -115, -193, -139], [12, -97, -193]]
[A]: [87, 52, -4, 82, 12]


[Q]: [[-107, 39, 75, -141, -68, -70, -13], [-23, 7], [-65, -179, 24, 67, -73], [-77, -122, 41, -97, -61, -95], [75, 5, -47, -191], [74, -62, -125], [-48, -17, -74, -199, -107, 22], [72, 20, -101, 42, -75], [43, 10, -76]]
[A]:
[75, 7, 67, 41, 75, 74, 22, 72, 43]