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]: [[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]
[A]: [67, 26, 7, -16, 78, 79, 4, 85, 35]


[Q]: [[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]
[A]: [-63, 82, 79]


[Q]: [[-31, -89, -194, -2, 66, 57], [81, -26, 28, -146, -161], [54, 46, -98, -86, 62, -31, -136]]
[A]:
[66, 81, 62]