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]: [[-29, -139], [-113, 72, 88, -95, -146, -186], [31, -151, -171, -180, -87, -12, -181]]
[A]: [-29, 88, 31]


[Q]: [[-48, 90, -121], [5, 61], [-123, -61, 18, 86, -3]]
[A]:
[90, 61, 86]