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: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]

Answer: [58, 19, 68]


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: [[42, -89, 46, -138], [-95, 82], [-3, -154], [11, 58, -187, -102, 85], [43, 39], [-1, -155, 91, -41, -151]]

Answer:
[46, 82, -3, 85, 43, 91]