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: [[50, -128, 17, 76, -122, 50], [6, -23, -7, -120, 28, -26], [-16, -60, -152], [28, -111, 22, -26, -61, -141, -16], [-51, 74]]

Output: [76, 28, -16, 28, 74]


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: [[-113, 87, 80, 93, -135, -85], [-139, -37, 7, -46, 95, -142, -193], [-189, -8], [-39, -150, -48, 68, -60, -165, -193], [66, -55, 62, 51, -43, -97], [-113, 12], [35, -156, 4], [-190, -13, 6, -15, 34, -10]]


Output: [93, 95, -8, 68, 66, 12, 35, 34]