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: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]

Answer: [38, 66]


Question: [[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]

Answer: [66, 16, 16, 69, 12, 80]


Question: [[-140, 50, -176, -28, -39], [-87, -173, 97, -172], [-147, -112, -93, -172, -32, 57, -114]]

Answer:
[50, 97, 57]