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]: [[-129, -155], [-197, -113, -8, -126, -172], [85, -141, -164, -98, 36]]
[A]: [-129, -8, 85]


[Q]: [[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]
[A]: [25, 59, -59, 90, 68, -84]


[Q]: [[19, -48, -54, -3], [45, 3, 75, -159, 36], [-47, 9, -9, -143, -183, -197, 85], [-98, 16, -55, 91, -41, -106], [-34, 82, -172, -130, -92, -170, -145], [-69, -19, -181, -178, 2]]
[A]:
[19, 75, 85, 91, 82, 2]