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]: [[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]
[A]: [71, 71, -38, 60, 7, 97, 76]


[Q]: [[-100, -43, 9], [-4, -170, 48, -129, 49, 83], [41, -102, -98, 81], [27, -183, 93, 47, -13, 51], [2, -61, -170, -73, 48], [2, -118, -152, -141], [-168, -73, -166], [15, 50, 32, 4]]
[A]: [9, 83, 81, 93, 48, 2, -73, 50]


[Q]: [[50, 97, 0, -199, -172, -200, 47], [40, -143, -126, 59, -147, -101], [-96, -24, -144, -150, -194, 86], [-51, -171, -179], [-129, 99, 0, -148, -25, -183, -68], [-21, 84, 27, 13, -184, -20]]
[A]:
[97, 59, 86, -51, 99, 84]