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: [[-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: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]

Answer: [55, 64, 56, -31, -4, 51]


Question: [[89, -86, -152, -72, 28, -196, -89], [92, 35, -70, -163, -25, -122, -107], [-66, -63, -173, 16], [-166, -11, -93, -122, -150]]

Answer:
[89, 92, 16, -11]