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]: [[-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]: [[-4, 11], [12, -196, -120, 66, -157, -72]]
[A]: [11, 66]


[Q]: [[34, 78, -2, 25, -99, 61], [20, -87], [41, -121, 83, -146, -146, -95], [-35, -85, 63], [-134, -188, -12, 40], [-58, -142]]
[A]:
[78, 20, 83, 63, 40, -58]