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: [[-200, -55, -94, 83, -144, -15], [83, -73, -2]]

SOLUTION: [83, 83]

PROBLEM: [[-59, 10, -4, -62], [-94, -163, -126, -159, -59], [87, -50, -102, -181, 99, -138], [48, -154, 17, -191], [-35, -12, -114, 18, -184], [80, 16, -193]]

SOLUTION: [10, -59, 99, 48, 18, 80]

PROBLEM: [[-182, -175, -162, -112, -195], [51, -20], [47, -144, -192, -187], [-84, -56, -62], [51, 53, -7], [47, -41, 29, 98, 29]]

SOLUTION:
[-112, 51, 47, -56, 53, 98]