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


[Q]: [[4, 27, 7, 92, -49], [-198, 59, -131, -73], [-130, -48, -135, 58], [57, -189, -99, 66, 51, 1], [90, 55, -174, -161, -148, -181]]
[A]: [92, 59, 58, 66, 90]


[Q]: [[-19, -100, 32], [-169, 38, 40, 41, -187, -84], [52, 59, 92, -30], [19, -52, -92, -108, -64], [-20, 42, -25, -53, -33, -85, -174], [23, 43, -45]]
[A]:
[32, 41, 92, 19, 42, 43]