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: [[-8, 97, -87, -60, -88], [0, -125, 0, 24, -155, -98], [-43, -150], [-196, 79], [-38, 51], [-88, -74, 28, -106, 45, 72]]

A: [97, 24, -43, 79, 51, 72]
****
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: [[83, -122, -114, -172], [-36, -192, -96], [92, 51, -169, -68, 71, -96], [-81, 17, -189], [-168, -84], [-151, -43, 75, 56], [-118, -64, -27, -40, 54, 33, -172], [-4, -130, 42], [21, -127]]

A:
[83, -36, 92, 17, -84, 75, 54, 42, 21]
****