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]: [[-178, 31, -89, -67, 55, -105], [-18, 92, -9, 69, -95, 92], [-95, 45], [-127, 57], [41, -37, 33, 41], [-72, -74, -86, -183, 86, 31], [35, -121, -199], [-165, -69, 85, -172], [14, 85, -46, -140, 25]]
[A]: [55, 92, 45, 57, 41, 86, 35, 85, 85]


[Q]: [[-31, -113, -173, -37, -4, -189, -191], [-32, 92, -46]]
[A]: [-4, 92]


[Q]: [[-25, 9, -184], [-195, -102, -58, -60, 57], [-100, 85, 17, -197, 99, -174]]
[A]:
[9, 57, 99]