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: [[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]

SOLUTION: [27, 65, -27, -9, -26, -33]

PROBLEM: [[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]

SOLUTION: [78, 80, 91, 99]

PROBLEM: [[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]

SOLUTION:
[-63, 82, 79]