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: [[-54, 43, 14, 3, -181, 28], [-137, -54, -62, -1], [40, -168, -120, -195, 17, -9, 6], [-100, 36, 80], [-9, 30, 73, 32]]

SOLUTION: [43, -1, 40, 80, 73]

PROBLEM: [[-65, -80], [-56, -98, 43, -194], [-152, -199, -81, -153, -164, -184, 97]]

SOLUTION: [-65, 43, 97]

PROBLEM: [[-76, -9], [-45, -37]]

SOLUTION:
[-9, -37]