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: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]

Output: [36, 69, 66, 79]


Input: Consider Input: [[-26, 54, 36], [-50, 30, -14], [-156, -199, 52, -83, 10], [-97, -59], [-14, 5, -188, -55, 74, -190], [43, -5, 14, 28, -77, -186, -74], [-200, -151], [-162, 64]]

Output: [54, 30, 52, -59, 74, 43, -151, 64]


Input: Consider Input: [[-135, 66, -133], [-38, -131, 55, 67], [-68, 49, -114, 85], [-7, -99, -147, -35, -128], [80, -184], [-166, 43], [-33, -54, 74, -188, -66]]


Output: [66, 67, 85, -7, 80, 43, 74]