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]: [[-18, 44, 37, -24], [-56, -127, -121, -102, -189, -43, -175], [-108, -188, 93, -46, -6], [4, -164, 23, 16], [-179, 9, -58]]
[A]: [44, -43, 93, 23, 9]


[Q]: [[3, -196, 93, -123, 16, 27], [-126, 48, 32, -70]]
[A]:
[93, 48]