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: [[-61, -130, -161, 8, -36, 53, -21], [-30, 55, -48, -10, -25, -183, -1], [-92, 93], [-144, -105, -78, 90, -32], [-87, -168, -25, 75, -48, -51, -86], [10, -17, 6]]

Answer: [53, 55, 93, 90, 75, 10]


Question: [[-139, -177], [-69, 92], [69, -10, -53, 2, -46, -139], [-78, -50, 16, 96, -177]]

Answer: [-139, 92, 69, 96]


Question: [[-140, -72, -116, -198, -22, -6, -118], [-28, 38, 9, 74], [66, -100, -166, -164, -155], [-30, -59, -195, -116, -26], [91, -109, -192, -151, 25, -194, 53], [33, 57, -176, -124, -30, -64, -171], [-79, 66, -98], [-173, -138, 60], [79, -10, -83]]

Answer:
[-6, 74, 66, -26, 91, 57, 66, 60, 79]