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: [[-32, -76, -121, -152], [-72, -164, -165], [-56, 43], [38, -76, 59]]

SOLUTION: [-32, -72, 43, 59]

PROBLEM: [[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]

SOLUTION: [96, 48, 65, 19, -26, 95, -11]

PROBLEM: [[-93, -179, -117], [-66, -86], [60, -198, -129, -29], [25, 38, -171, 64, 65]]

SOLUTION:
[-93, -66, 60, 65]