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: [[-188, -197, -169], [-122, 14, -180, -164, 67, 0, 29]]

SOLUTION: [-169, 67]

PROBLEM: [[32, -166], [-87, -91], [-117, -118, -8, -117, -61], [-146, -85, -111, -57, -91], [-197, -90, -121, -91, -66], [-154, -89, -37, -43], [-146, -95, -159, -141, -170, -8, -35], [-91, -68, -199, -180]]

SOLUTION:
[32, -87, -8, -57, -66, -37, -8, -68]