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: [[-4, -199, -162, 33], [25, -194, -157, -39, -122, 100, -108], [-25, -181, 74, -116, -119], [69, -124]]

SOLUTION: [33, 100, 74, 69]

PROBLEM: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]

SOLUTION: [45, 33, 26, 69, 89, 95, 57, -4]

PROBLEM: [[-174, -182, -123, -63], [-1, -98], [17, -43, -112], [-71, 73, 37, -100], [50, -46, -138], [-59, 0, -159, 6, -151, 93, -147], [-103, -10, -33, -22, -139, -78]]

SOLUTION:
[-63, -1, 17, 73, 50, 93, -10]