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: [[89, 48, 81, 67, 22, 14], [-78, 84]]

SOLUTION: [89, 84]

PROBLEM: [[-57, -10, -27, -160], [-80, -130, -16, 25], [-65, -106, 30, -104, -20, 77], [-192, -87, -49, 64, 43, 94, 82], [-81, -10, 20, -28, 79, 73, -1], [-191, -83, -113, 40, 6]]

SOLUTION: [-10, 25, 77, 94, 79, 40]

PROBLEM: [[-104, -35, -96], [12, -101, -118, -93], [15, 60, 53, -192, -197], [-117, -132, -199], [34, -173, -174, -170, 60, -42]]

SOLUTION:
[-35, 12, 60, -117, 60]