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: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]

Answer: [49, 34, 10, 52, 78, 31, 30, 18]


Question: [[-14, -150, -93, 55, -98, 54, -132], [-132, -64, -152, -37, -15], [-130, -137, -25, -40, -15, -165, 19], [-45, -121, -64, 99, -19], [-158, -6, -199, 91, -106], [-149, -111, 85, -94, 43, -185, -23]]

Answer: [55, -15, 19, 99, 91, 85]


Question: [[98, 46, -163, -71, 14], [-45, -139, 7, 51, -165, -74], [80, -31, 14]]

Answer:
[98, 51, 80]