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]: [[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]
[A]: [57, 80, -20, -50, 8, 64]


[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]: [[-146, -140, -66, 48], [25, 92], [-178, -182, 33, 85, 14, 31], [70, 20, -8, -192, -197, -168], [-138, 54, 76, 44, -15], [98, 35, -168, 85], [-71, -90, 100, -175, 12, 72, -161]]
[A]:
[48, 92, 85, 70, 76, 98, 100]