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: [[18, 65, 44, -95, -55], [-117, 45], [-29, -66, -85, -25, -53, 9]]

Output: [65, 45, 9]


Input: Consider Input: [[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]

Output: [93, -100, 50, 56, 90, -87, 74, 82, 49]


Input: Consider Input: [[83, 75], [-75, -74, -58, 49], [-76, -127, -179, -200, -104, -99], [-57, -129, -137, 94, -63, -58], [82, -89, 29, -172]]


Output: [83, 49, -76, 94, 82]