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: [[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]

Output: [93, 68, 96, 94, 81, 71]


Input: Consider Input: [[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]

Output: [67, 26, 7, -16, 78, 79, 4, 85, 35]


Input: Consider Input: [[38, -129, -65, -200, -19], [-44, -36, -91, -78], [-39, -9, -93, -118], [12, -38, 36, 0, -47, -96, 82], [58, -152, -121, -1, 96, 54], [-192, 9, -116, -98, 25, -142, -114], [-25, -31, -1]]


Output: [38, -36, -9, 82, 96, 25, -1]