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: [[38, -34, 24, 52, -11, 5], [-79, -185, 72, -181, 76], [-87, 25, 70, -182], [-10, 93, -144], [-96, -18, -23, 26, -100], [-79, 41, 99, -121, -68, -11], [-133, -37, -58, 12, -84, -79], [93, 94, -160, -81, -128, -122, -42]]

Output: [52, 76, 70, 93, 26, 99, 12, 94]


Input: Consider Input: [[-65, -50], [19, -143], [-141, -11, 89, 95, -57], [3, -105, -140, 17, -50, -97, -91], [-59, -147, 52, 54, -42], [-44, 88, 69, -166, -2], [-195, 53, -94, 4, 84, -84], [-138, 62, -137, -30, 92]]


Output: [-50, 19, 95, 17, 54, 88, 84, 92]