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: [[-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: [[-88, 24], [-125, -39], [95, -76, -84, -69, -190, -148], [-196, 71, -2, -91, -112]]

A: [24, -39, 95, 71]
****
Q: [[94, -71, -83, -154, -126, -62, -104], [-168, 66, 9, -12]]

A:
[94, 66]
****