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]: [[93, 55, 18, 28, -87, -59], [-181, 6, -163, -78, 17], [70, -41, 36, 78, 67, -180], [-180, 84, 59], [-155, 35]]
[A]: [93, 17, 78, 84, 35]


[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]: [[69, -160, 65], [-95, 94, -31, 37, -64, 43, 45], [63, -154, -132, 34]]
[A]:
[69, 94, 63]