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]: [[-2, -59, -139, -19, -120], [-148, 59, 73, -148, 27], [94, -73, -135, 45, -75, 23], [81, -132, 2, -132, 49]]
[A]: [-2, 73, 94, 81]


[Q]: [[-44, -145, 83, -107, -25], [-86, 59, -176, 37, 50, 36, -129], [-22, 55, 65, 57, -9], [56, -191], [83, -160, 43], [-59, 76, -121, -152, 99, -87, 93], [-152, -119, 98, -89, -180], [-79, -11, 11, -44, 15, -180, -121], [24, -33, -179, -111, 82]]
[A]: [83, 59, 65, 56, 83, 99, 98, 15, 82]


[Q]: [[-176, 36, 94, 7, 55, 29], [-66, 24, -23, -199, -43, -40], [-99, -187, -132, -129, 12]]
[A]:
[94, 24, 12]