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]: [[-72, -37, -51, 45], [-102, 17, -162, -122, -145], [-40, 31, -71, 89, 92, -3, 16], [-155, -190, 12, 3], [-2, -150, -94, 28, -52, 7], [-150, -106, 8], [-102, -174, -93, -186, -194]]
[A]: [45, 17, 92, 12, 28, 8, -93]


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


[Q]: [[85, -50, -183, -186, 34, -171], [81, -1, 6, 41, 27, 50, 46], [94, -189, -14], [89, -66, 49, 100, -24, 56, -48], [-43, -142, -186, -172, 20], [-83, 47, 98], [-16, 6, 21, -162], [-73, 92, -177, 21, -19, -156]]
[A]:
[85, 81, 94, 100, 20, 98, 21, 92]