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: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]

Answer: [60, -32, 68, 93, 24, 26, 7, 85]


Question: [[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]

Answer: [95, 58, 72, 99, 80, 89, -18, -25]


Question: [[-56, -157, -87, -142, -166, -185], [-144, -107, -69, -159, -3], [-121, 67], [-51, -12, 0], [-42, 8, -114, -49, 81, -123], [-91, -57, -166, 64, -152], [89, -197], [-153, -63, -98, 39, 32, -195]]

Answer:
[-56, -3, 67, 0, 81, 64, 89, 39]