TASK DEFINITION: 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.
PROBLEM: [[-33, -17, 16, -125], [-15, 51, -194, -36, -4, 40], [-163, -197, -185, 99, -114, -157, 41], [35, -1, -14, -73, -149]]

SOLUTION: [16, 51, 99, 35]

PROBLEM: [[-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]]

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

PROBLEM: [[17, 30, -154, -114, 89, 56], [-48, 23, -170, 29, -96, 75, 10], [27, -178, 70, 16, -88, 34], [-5, 69, -72, -55], [57, -189, -143]]

SOLUTION:
[89, 75, 70, 69, 57]