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]: [[20, 71, -57, -136, 45], [-3, -147, -182], [48, -161, 35, -16, -193], [7, 90, -78, -102], [-108, 92, 30, -147, -86, -132]]
[A]: [71, -3, 48, 90, 92]


[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]: [[52, -149, 1, 17, 0], [65, -158, 63, -143], [-111, -196, 9], [61, -43, -85, -108, 44, -126], [-92, 8, -25]]
[A]:
[52, 65, 9, 61, 8]