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, -29, 4, 70, -1, 66], [-63, -199], [-128, 88], [-80, -95, -40, 51, -97], [-55, -200, -186], [-103, -104, -9, -179, 93, -82, -129]]

SOLUTION: [70, -63, 88, 51, -55, 93]

PROBLEM: [[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]

SOLUTION: [85, 82, 95, -111, 24, -112, 65, 65, 16]

PROBLEM: [[42, -83, 65, -177, -65, 71], [-162, -121, 32, -75, -112, -106], [-32, -157, -200, -92, 72, -172, 8], [-182, -49], [-189, -100], [59, 92, -51]]

SOLUTION:
[71, 32, 72, -49, -100, 92]