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: [[-120, -84], [10, 74, -15, -153]]

SOLUTION: [-84, 74]

PROBLEM: [[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]

SOLUTION: [35, -69, -81, 92, 91, 58, 48, -41]

PROBLEM: [[-77, -158], [-122, -51, -184, -188, 66, -24]]

SOLUTION:
[-77, 66]