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]: [[76, -83, -46], [3, 41, -151, -14, -59], [73, 90, -134, 22], [1, -181, -112, -177, 32, -93], [-142, -184, 39, -5]]
[A]: [76, 41, 90, 32, 39]


[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]: [[63, -44, -23], [-142, 61, -17], [-161, -196, -113, -49, 3, -130, -176], [-114, -19, -51, -46, -14], [-110, -110, 30, 32, 63, 26], [-103, 25, 30, -43, -187]]
[A]:
[63, 61, 3, -14, 63, 30]