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: [[-59, 10, -4, -62], [-94, -163, -126, -159, -59], [87, -50, -102, -181, 99, -138], [48, -154, 17, -191], [-35, -12, -114, 18, -184], [80, 16, -193]]

Output: [10, -59, 99, 48, 18, 80]


Input: Consider Input: [[-183, 42, 41, 27, -157], [-49, -170, -103, -128], [94, -192], [42, 89], [-73, -107, -134], [5, -23, -9, 4, -151], [-96, -41, -85, -120], [-82, -74, -32, 89]]

Output: [42, -49, 94, 89, -73, 5, -41, 89]


Input: Consider Input: [[-179, 73, -55, -43], [-195, -182, -146, -198, -1], [-182, -173, 62, 1, 12], [-84, 70, -111, -102], [30, 60, -121, 70, -111, 60], [-149, 32, -142], [-150, 33, -55, -173, -117], [-22, 40, 84, -59, -39]]


Output: [73, -1, 62, 70, 70, 32, 33, 84]