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: [[-65, -80], [-56, -98, 43, -194], [-152, -199, -81, -153, -164, -184, 97]]

SOLUTION: [-65, 43, 97]

PROBLEM: [[-46, 14, -141, -77, -62], [-183, -86, -115], [-146, -60, 34], [-42, 19, -101, -49, 47], [-117, -174]]

SOLUTION: [14, -86, 34, 47, -117]

PROBLEM: [[76, -129, -198, 6, 7, 22, -116], [65, -135, -155, 78], [-84, -200, 20, -171, -18], [36, -146]]

SOLUTION:
[76, 78, 20, 36]