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: [[-138, -72], [-151, 92, -186, 54], [-169, -71, 6, -69, 0, 15]]

A: [-72, 92, 15]
****
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: [[90, -103, 36, 31, 56, -157, -182], [-22, -125, -153, 36, 38], [-148, 48, -28, -140, -178, -121], [-87, -141, -50, -183, -18, -46, 23], [-46, -86, -167, -46, 93], [23, 87, -62, -129, -146, -81, 30], [-188, 90]]

A:
[90, 38, 48, 23, 93, 87, 90]
****