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: [[-21, -17, -178, 61, -92, -68], [-171, 1, -185, 17, -19, 4, -95]]

Answer: [61, 17]


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: [[-186, -88, -33, -160, 80], [53, -17, -173, -60, 97, -66], [91, -90, -60, 37, 79, 3], [-23, -23, 31, -12, -174, 43, -163], [71, -124, 18], [-131, 34, 19, -143, -36, -58], [-78, -197, -80], [-82, -91, -103, 21], [8, -29, -168, 5, 99, -131]]

Answer:
[80, 97, 91, 43, 71, 34, -78, 21, 99]