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]: [[-6, 41, -190], [-47, 89], [29, -17, -135]]
[A]: [41, 89, 29]


[Q]: [[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]
[A]: [86, 76, -100, 99, 27, -48]


[Q]: [[50, 72, -83], [-9, 47, -177, -156, -171], [-200, -23], [-99, -2, -193, -137], [-72, -62], [-159, 21, -157, 17, 34, 4, -108]]
[A]:
[72, 47, -23, -2, -62, 34]