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: [[-150, 25, -177, 29, 1], [85, 82, -6, -151, -93, -182], [-181, 99, 32, 16, -116, 89], [-29, -186, -40, -7, -64, -29, -33], [-27, -68, -126], [-77, -3, -144]]

Output: [29, 85, 99, -7, -27, -3]


Input: Consider Input: [[-75, 10, -138, -42, 85, 8, -74], [18, 10, -70, 74, -88, -117, -145], [65, -145, 24, -193, -120, -186, -14], [-172, -115, -146], [-87, -180, -38, 77], [91, -50, -12, -23, -38, -89, 71], [-58, 81, -175], [-197, -145, 57, 94, -78, -184, -133], [-50, -183, -127, -77, 41]]

Output: [85, 74, 65, -115, 77, 91, 81, 94, 41]


Input: Consider Input: [[90, -50, -187, 83, 53], [62, -167, -99], [-46, -178, -132, -107, 17, 26], [-35, -152, -39, -194, 71, -4], [-193, -117, -42, -118, -77, -123], [-69, -111, -81, 85, -160, -176, -54], [-14, -189], [-178, -100, 80, 69, 42, 59, -45]]


Output: [90, 62, 26, 71, -42, 85, -14, 80]