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: [[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]

SOLUTION: [10, 83, 86, 22]

PROBLEM: [[-178, 31, -89, -67, 55, -105], [-18, 92, -9, 69, -95, 92], [-95, 45], [-127, 57], [41, -37, 33, 41], [-72, -74, -86, -183, 86, 31], [35, -121, -199], [-165, -69, 85, -172], [14, 85, -46, -140, 25]]

SOLUTION: [55, 92, 45, 57, 41, 86, 35, 85, 85]

PROBLEM: [[-28, -65], [-160, -173, -176, 70, 76, -96]]

SOLUTION:
[-28, 76]