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]: [[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]
[A]: [-7, 71, 29, 59, 93, 71]


[Q]: [[-18, 44, 37, -24], [-56, -127, -121, -102, -189, -43, -175], [-108, -188, 93, -46, -6], [4, -164, 23, 16], [-179, 9, -58]]
[A]: [44, -43, 93, 23, 9]


[Q]: [[-185, -35, 89, -148, -150, -58, -164], [-14, 59, -41, -156], [-48, 37, 62], [-88, 63, -167, 6, -10]]
[A]:
[89, 59, 62, 63]