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]: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]
[A]: [79, -33, 2, 42, 81, -142, 71]


[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]: [[-63, -149, -104, 72, -62], [-83, -27, 26, -174], [-135, -77, 54], [-87, -88, -20, -55, -105, 49, -31], [90, 32, -146, 4, -139, 85], [7, -184, 49, -161, -175, -41], [-15, -96, -79, -17, 56, 44], [-119, -190, 71, -173, -37], [77, -152, -74]]
[A]:
[72, 26, 54, 49, 90, 49, 56, 71, 77]