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: [[-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: [[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]

Output: [98, -11, 98, 26, 10]


Input: Consider Input: [[-113, -107], [58, -145], [58, 75, -174, -51], [-115, 20, 81, -90, 74], [-5, 61, -56, -145], [23, 2, -102, -22], [-92, 11, 99, 84, 79, -156, -138]]


Output: [-107, 58, 75, 81, 61, 23, 99]