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]: [[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]
[A]: [18, 79, 47, 72]


[Q]: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]
[A]: [36, 69, 66, 79]


[Q]: [[10, -62], [-99, -145, -183, 36, -116], [-198, -35, -182], [78, 84], [19, 63, -138, 75]]
[A]:
[10, 36, -35, 84, 75]