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]: [[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]
[A]: [27, -10, 40, 78, 74, 22, 51]


[Q]: [[-60, -15, -145, -17, -184, -199], [-146, -105, 64, -192, -170, 17, 69]]
[A]: [-15, 69]


[Q]: [[30, 4, -78, 19, -110], [-6, -10, 46], [89, -108, -148, 9, -109]]
[A]:
[30, 46, 89]