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]: [[-33, -17, 16, -125], [-15, 51, -194, -36, -4, 40], [-163, -197, -185, 99, -114, -157, 41], [35, -1, -14, -73, -149]]
[A]: [16, 51, 99, 35]


[Q]: [[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]
[A]: [100, 3, 97]


[Q]: [[-151, -79, -128, -77, -126, -35, -116], [87, 55, -19], [-96, -151]]
[A]:
[-35, 87, -96]