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]: [[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]
[A]: [89, 47, 19, -36]


[Q]: [[-198, -161], [66, 7, 92, 36, -103, -44], [-121, 33, 33, -183, 81, -87, 6], [-125, 1, -186]]
[A]: [-161, 92, 81, 1]


[Q]: [[92, 71, -35], [58, -196, -193, -84, -116, -31], [95, -102, -160, -171, -62, 27], [-199, 28, -48, -52], [-139, -4, -179, 51], [24, -51, 4, -189, -118], [40, -68, -184, -96]]
[A]:
[92, 58, 95, 28, 51, 24, 40]