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]: [[10, -182, -172, -154, 42, -42, -159], [10, -7, 32, -26], [-79, -77, -179], [57, 21, -139, -114, 23, -177, 24], [-122, 57, -110, 84], [42, -107, -190, -73, -184, -186]]
[A]: [42, 32, -77, 57, 84, 42]


[Q]: [[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]
[A]: [53, 41, 80, 98, 91, 62]


[Q]: [[-62, -125, -115], [-87, -200], [-13, -146, -181, -183, -24], [-134, -22, 60, 25, -97, -58, -86], [-146, -13, -72]]
[A]:
[-62, -87, -13, 60, -13]