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: [[47, -65, -11, 25, -17], [-93, -195, -89, 27, -81, -190], [-59, -20, -10, 93, -93], [-130, -31, 67, -36, -18, -125], [54, 100, -27, -38, -154, -96], [-148, 23, 70, -162, -145], [-83, -95, -44, 11, -155], [-43, -195, -94, -5], [-17, -99, -23, -176]]

Answer: [47, 27, 93, 67, 100, 70, 11, -5, -17]


Question: [[-125, -150, -5], [-100, 46, 65, 64, 5, -15, -82]]

Answer: [-5, 65]


Question: [[-50, -75, -50, 10, -50], [17, 75, -122, -169], [-55, -22, -9, -190, -166, -198]]

Answer:
[10, 75, -9]