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]: [[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]
[A]: [95, 47, 66, 75, 33, 72, 9]


[Q]: [[-2, -170, -178, -115], [52, 57, -200, -86, 14, 31, -19], [-121, 20, -2, -173, -85, -115, 97], [30, -119, -33], [-40, -53, 24, -133, -196]]
[A]: [-2, 57, 97, 30, 24]


[Q]: [[-129, -69], [30, -38, 4, -6, -19, -20, 66], [-26, -152], [-92, -53, 87], [16, -140], [28, 33, 49, 10, -198]]
[A]:
[-69, 66, -26, 87, 16, 49]