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.

[EX 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]]
[EX A]: [95, -16, 64, -12, 45, 87, 74, 48, 75]

[EX Q]: [[-130, -20, -171, -122, 49, -43], [-173, -82, 17], [87, -55, -70, -113], [69, 10, -121, -177]]
[EX A]: [49, 17, 87, 69]

[EX Q]: [[-166, -47, -160, -50, -68], [61, -31, -140, 41, -92, -10], [54, -80, 98, 8], [91, -88, -3, -107], [-89, -5, 15], [-118, -18, -81]]
[EX A]:
[-47, 61, 98, 91, 15, -18]