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: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]

Answer: [95, 60, 31, -122, 66, 84, 17]


Question: [[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]

Answer: [85, 82, 95, -111, 24, -112, 65, 65, 16]


Question: [[-107, 20, -117, -199, -29, -69], [-26, -6, -86, -122, -78], [-65, -39, 83], [39, -157, -145, -2, 43, -172]]

Answer:
[20, -6, 83, 43]