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: [[-79, -29, 95, 11, -47, -37], [-61, -14, 2, 63, 18, -44, 60], [67, -61, -152, -108, -184, 85], [-7, -135, -113, -81, -146, -34], [74, 58], [-139, 40, -181, -95], [83, -28, -200], [80, -130, -174, 36, 19], [12, 70, -198, -62]]

Answer: [95, 63, 85, -7, 74, 40, 83, 80, 70]


Question: [[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]

Answer: [81, 84, -3, 93, -41, 21, 6, 87, -16]


Question: [[19, 8, -84, -19, -129, 65, -193], [-53, 72, 79], [-47, 66, 52], [-61, -3, 55, -92, -184, 63, 52], [-36, 43], [-81, -65, 50]]

Answer:
[65, 79, 66, 63, 43, 50]