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: [[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]

Answer: [-18, 95, 50, 81, 49, 91, 94, 59]


Question: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]

Answer: [45, 33, 26, 69, 89, 95, 57, -4]


Question: [[-149, -171, -63], [-3, -125], [27, 31], [35, 33, -5, 32, -141], [-25, -12, -106, -144, -26, 85], [-198, -107, -70, 45, -56, 20]]

Answer:
[-63, -3, 31, 35, 85, 45]