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.

Input: Consider Input: [[-21, -17, -178, 61, -92, -68], [-171, 1, -185, 17, -19, 4, -95]]

Output: [61, 17]


Input: Consider Input: [[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]

Output: [91, 100, 86, 84, 13, 53, -32, 54]


Input: Consider Input: [[-11, 41], [95, 35, -55, -15, 7]]


Output: [41, 95]