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: [[7, 12], [-173, 15, -64, -64, -10, 54], [87, 73, -93, -48, -75, -135]]

SOLUTION: [12, 54, 87]

PROBLEM: [[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]

SOLUTION: [-18, 95, 50, 81, 49, 91, 94, 59]

PROBLEM: [[83, 35, -186, -197, 14, 59, -184], [35, -32, -30, 5, 22, -158, -165], [-139, -75, 68, -82, -57, 69]]

SOLUTION:
[83, 35, 69]