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]: [[-92, -7], [1, -45], [53, -66, 54, -79, 17, -157, -142], [-9, -143, 9, -59], [-14, -179, -102, -29, -37], [-122, -171, -56, 94], [14, -199], [-83, -87]]
[A]: [-7, 1, 54, 9, -14, 94, 14, -83]


[Q]: [[91, -34, 63], [10, -130, 82, 21, 45], [-115, 18, -41, -36, -96], [-147, 46, -124, -139], [-173, -23, 37, -171, -65, -21, -42], [-191, -172, -147, 17, -27, -124], [19, 46], [-46, -174, 74]]
[A]: [91, 82, 18, 46, 37, 17, 46, 74]


[Q]: [[35, -145, -134, -196, -149, -132, 68], [-5, 45, -172, 78], [-95, -190, -71, 18, -72], [66, -59, -115, -19, -34], [-98, -151, -34]]
[A]:
[68, 78, 18, 66, -34]