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]: [[-40, -40, 89, -120, 33], [-157, -13, 7, 45], [35, -131, 87, -23], [-125, 77, 68, -106, -2], [89, -90, 15, -2, 42, -95, 72], [-4, -179], [-119, -79], [41, -12, -110]]
[A]: [89, 45, 87, 77, 89, -4, -79, 41]


[Q]: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
[A]: [60, -32, 68, 93, 24, 26, 7, 85]


[Q]: [[-103, 0], [88, -84, 80, -6, 65, -122], [-6, 63, -45, -199], [-150, -187]]
[A]:
[0, 88, 63, -150]