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: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]

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

PROBLEM: [[-4, -199, -162, 33], [25, -194, -157, -39, -122, 100, -108], [-25, -181, 74, -116, -119], [69, -124]]

SOLUTION: [33, 100, 74, 69]

PROBLEM: [[-72, -70], [-2, -181], [-142, -197], [62, -117, -150, 40], [-56, -63, 45, -139, 3, -142]]

SOLUTION:
[-70, -2, -142, 62, 45]