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: [[-16, -86, -146, -2, 45, -193, 6], [-125, -194, 40, 86, 15, -146, -131], [-150, 75, 6, -6, -39, -138]]

Answer: [45, 86, 75]


Question: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]

Answer: [98, 30, 96, 87, 96, 67, 53]


Question: [[-138, -117, -99, -112], [63, -141, 4], [-23, -89, -24, 42], [-5, -181, -191, -105, -46], [-91, -176], [97, -178, -75], [-34, 62, 11], [57, 72, -165, 2, 78, -128, 0]]

Answer:
[-99, 63, 42, -5, -91, 97, 62, 78]