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, -141], [-153, 62, 13, -129], [-197, 78, 14, -101], [40, -136, -81, -138], [-182, 84], [47, -184, -16], [5, -28, -3, -174, -139], [91, -121, -61, 55, 42]]
[A]: [20, 62, 78, 40, 84, 47, 5, 91]


[Q]: [[-130, -20, -171, -122, 49, -43], [-173, -82, 17], [87, -55, -70, -113], [69, 10, -121, -177]]
[A]: [49, 17, 87, 69]


[Q]: [[96, 16, -29, -179, -185, 55], [-130, 98, 93, 2, -159, -2], [-138, -46, -185, -3, 14], [-48, 5, 82, -173, -142, 54], [-63, 64, 84, -11, 58]]
[A]:
[96, 98, 14, 82, 84]