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: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]

SOLUTION: [75, 51, 10, 53, -43, 17, -111]

PROBLEM: [[-88, -73, 65, 51, -100], [-75, -195], [-115, 4, -152, -151, -65, 95, 85]]

SOLUTION: [65, -75, 95]

PROBLEM: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]

SOLUTION:
[12, -16, 41, 50]