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: [[-56, -17, -187], [-135, -22, 5], [41, -132, -73, -106, -40], [4, -165, -9, -32, -167, -112], [-73, -120, -55, -46, -49, -71], [80, -199, -188, 25, -12, 7], [-22, -124, -193, 28, 92, 27], [-183, -80, 7, -156, 65], [61, -127, -144, -99, -195, 69]]

Output: [-17, 5, 41, 4, -46, 80, 92, 65, 69]


Input: Consider Input: [[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]

Output: [84, 1, 35, -78, 24, 87]


Input: Consider Input: [[-123, -139, 73], [-85, -161, -188, -30], [68, -22, 45, -41], [15, 81, -24, -130, -147, 10, -20], [-174, 100, 66, 49], [-82, -69, -31, -163, -45, -125], [-130, -100, -21, -180, 98, -24, -31]]


Output: [73, -30, 68, 81, 100, -31, 98]