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]: [[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]
[A]: [-121, 80, 98, 56, -17, 10, 55]


[Q]: [[-6, 41, -190], [-47, 89], [29, -17, -135]]
[A]: [41, 89, 29]


[Q]: [[-52, 60, 52], [21, -126, -145, -148, 14, -82], [-199, -140, 63, 71, -199, -184], [-34, -27], [-131, -33, -124], [50, -122, -61, -149], [61, 96, -157], [-183, 6, -80, 94, -4], [23, -185, -30, -14, -75, -73]]
[A]:
[60, 21, 71, -27, -33, 50, 96, 94, 23]