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: [[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]

SOLUTION: [-66, -6, 91, 69, -24, 72]

PROBLEM: [[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]

SOLUTION: [74, 78, -132, 63, 73, 39]

PROBLEM: [[-32, -76, -121, -152], [-72, -164, -165], [-56, 43], [38, -76, 59]]

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