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.
--------
Question: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]

Answer: [12, -16, 41, 50]


Question: [[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]

Answer: [95, 58, 72, 99, 80, 89, -18, -25]


Question: [[44, -146], [-38, -81], [-147, -58], [31, 2, 81, -153, -197, 71, -160], [-40, -144, -9, -68]]

Answer:
[44, -38, -58, 81, -9]