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]: [[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]
[A]: [84, 1, 35, -78, 24, 87]


[Q]: [[-155, -167, -150, 0], [16, -57, -93, -128, -43, -97, 22], [17, -179, -11, 15], [-77, -129, 48, -163, -66], [-52, 31, -142, 80, 48, -15]]
[A]: [0, 22, 17, 48, 80]


[Q]: [[0, 0], [-46, -159, -35, 65], [-6, 73, -132, 39, 99, -20, -195], [-132, -150, 87, -181, -183, -61], [-31, 84, 55, 73, 44], [-145, 13, -154, -12, -61, 36], [49, -194, 99, 27, -174, -145], [57, -140, -128, -74, 13, 69, -186]]
[A]:
[0, 65, 99, 87, 84, 36, 99, 69]