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: [[-15, 18, 88, 39, -96], [-65, -76, 85, 2, -58], [41, -103], [-15, -196, -94, 13], [-57, 25, -169, -18, 42, -114], [-131, -61, 20, 42, -92, -50], [-93, -35], [-22, -200, -74, 17, -67, -17]]

Answer: [88, 85, 41, 13, 42, 42, -35, 17]


Question: [[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]

Answer: [-111, 83, -8, 92, 55, 91, 70]


Question: [[-177, -160, -149, 100], [-29, -174, -24, 99, -88, -176], [-96, 30], [2, 66], [29, -114, -36], [-193, -59, 72, -81]]

Answer:
[100, 99, 30, 66, 29, 72]