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: [[-129, -155], [-197, -113, -8, -126, -172], [85, -141, -164, -98, 36]]

SOLUTION: [-129, -8, 85]

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: [[-187, -6, -129, -105], [-72, -54], [2, -180, 69, 24], [9, -36, -71, -161], [2, -168, 43, 100, -189, -200, -41]]

SOLUTION:
[-6, -54, 69, 9, 100]