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: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]

Output: [38, 66]


Input: Consider Input: [[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]

Output: [87, 7, 73, 69, 96, -106, 48, 84]


Input: Consider Input: [[-126, -20], [-191, -179, -127], [-79, 43, -170, -173, -44], [6, -149, -197, -71, -88], [70, 33, 59, -84, -35, 97], [-84, -129, -110, 12, -107, -57, 100], [74, -110, -95, 95, 46, -35, 93], [-109, -111, -112]]


Output: [-20, -127, 43, 6, 97, 100, 95, -109]