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: [[-105, -189, 19, -65, -189, -88, -117], [39, 62], [44, -144]]

A: [19, 62, 44]
****
Q: [[-56, -17, -187], [-135, -22, 5], [41, -132, -73, -106, -40], [4, -165, -9, -32, -167, -112], [-73, -120, -55, -46, -49, -71], [80, -199, -188, 25, -12, 7], [-22, -124, -193, 28, 92, 27], [-183, -80, 7, -156, 65], [61, -127, -144, -99, -195, 69]]

A: [-17, 5, 41, 4, -46, 80, 92, 65, 69]
****
Q: [[4, -141, 13, -17, 86], [-83, -182, -97, -53, -199, 96, -143], [-64, -152, -58, -154], [-157, -110, 51, 51], [-40, -70, -79, 72, -49, 21, 26], [-171, -44]]

A:
[86, 96, -58, 51, 72, -44]
****