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: [[-99, -20, 1, -195], [47, -92, -16, 34, -113, 62, 3], [-200, -20, -92, 100], [-27, -94, 26, -53, -67], [-73, -16, -70, 12, 85, -173, -193], [-183, -64, -9, 56, -73, -21, -76], [-69, -9, -193, -108, -97]]

SOLUTION: [1, 62, 100, 26, 85, 56, -9]

PROBLEM: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]

SOLUTION: [38, 66]

PROBLEM: [[14, -139, -112, -76, -153, -132], [-140, -4, -167, -112, -78, -190], [-192, 6, -177, -36, -62, -14, -189], [-129, -18, -53, -91, -174], [40, -132, -30, 96, 75, 25, 99]]

SOLUTION:
[14, -4, 6, -18, 99]

