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: [[95, -100, -10], [-52, -130, -16, -86, -37, -181], [-126, -10, 3, -135, -67, 64, -5], [-101, -96, -155, -12, -63], [-130, -187, 20, 45], [-176, 87, -135, -75, -90, -189, -200], [-53, 74, -52, 29, -150], [-192, 48, -15, -148, -175], [75, -148]]

A: [95, -16, 64, -12, 45, 87, 74, 48, 75]
****
Q: [[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]

A: [79, 65, -87, 89, -2, -13, 20, -184]
****
Q: [[-139, 43, -43], [53, 23, -198, -5]]

A:
[43, 53]
****