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: [[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]

Output: [66, 16, 16, 69, 12, 80]


Input: Consider Input: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]

Output: [90, 98, 22, 85, 64, 77, 63, -152]


Input: Consider Input: [[32, -146, -150, 72, 4], [-11, 13, -149, -32, -72, -169, -150], [-179, -61, 45, -52], [-146, -93, 30, -20, 93], [-133, -170, -171, 91, -29, 8, -107], [-84, -145, -39, 60, -24, 37]]


Output: [72, 13, 45, 93, 91, 60]