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]: [[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]
[A]: [100, 3, 97]


[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]: [[-62, 79, 22, -106], [-2, -119], [-125, 82, -3, -62], [-42, -25, -77, 99, 85, 74]]
[A]:
[79, -2, 82, 99]