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]: [[40, -40, -148, -172], [-116, -46, 92, -51, -20], [-161, -93, 46, -56], [3, -153, 79, -38, 62, -57]]
[A]: [40, 92, 46, 79]


[Q]: [[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]
[A]: [96, 48, 65, 19, -26, 95, -11]


[Q]: [[-77, -75], [-151, 70, -87], [8, -70, -6, 67, -124], [-49, -46, 15, 82, -45]]
[A]:
[-75, 70, 67, 82]


