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: [[-153, 77, 64, -116, -130], [-176, -137, -198], [22, -14, -129, 76, -76], [-15, -37, 92, -141, -51], [13, 89, -191, -24, -197], [-11, 30, -51, 61, 26, 7, -105], [-126, -126], [-178, -132, 98, -22, 77], [7, -190, 60, -51, 62]]

SOLUTION: [77, -137, 76, 92, 89, 61, -126, 98, 62]

PROBLEM: [[73, 34, -108, -189, 65], [44, -171, -64, 39], [-78, -147, -179, -164, -98], [-158, 24, -160, 68, -74]]

SOLUTION:
[73, 44, -78, 68]