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]: [[-120, 64, 10, -43], [-7, -30, -37, -45, 4, -185], [-17, 44, -62, -97, -5, 10, -20], [7, 91, -56, 24], [-138, -169, -139, -172, 57, -53], [62, 31, 12, 20, -182, -188, -198], [-45, -3, -11, -187], [-10, -200, -76, -160, -151]]
[A]: [64, 4, 44, 91, 57, 62, -3, -10]


[Q]: [[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]
[A]: [93, -100, 50, 56, 90, -87, 74, 82, 49]


[Q]: [[71, 89], [31, 37, 22, 69, -49, -2], [-142, 55, -6, -152, 40, -116], [53, -26, 65, -173, -120, 5], [38, -32, 84, -63]]
[A]:
[89, 69, 55, 65, 84]