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]: [[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]
[A]: [-63, 82, 79]


[Q]: [[79, -185, 24], [38, 8, 46, 27, -43, -100]]
[A]: [79, 46]


[Q]: [[-71, -169, 96, -180, -164, 79], [-122, -185, -106, 40, -31, -83], [64, -190, -84, 75, -52], [-7, 97, -75, -172], [-7, -51, -122], [19, -161, -171, -98, 57, 56], [78, -13, 75, -40, -99, 51], [-138, -63, -165, -12, 6, -107, -91]]
[A]:
[96, 40, 75, 97, -7, 57, 78, 6]