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]: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]
[A]: [91, -49, 89, 83, 92, -91]


[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]: [[-47, -196, 47, -137, -185, -63, 46], [82, -41, -70], [-37, -147, 87, 36, -158, -108], [32, -180, 85, 14, -59, 64, 19], [-51, 19, -175, -73, -196, -25], [91, -31], [-3, 31, -164], [-100, 63, -79, 99, -151, 80]]
[A]:
[47, 82, 87, 85, 19, 91, 31, 99]