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, -24, 22, -153, 38], [34, 6, -5, 98, -168], [-137, -175, -142, 39, 10, -54, -95], [-127, -48, -200, 24], [-166, -170, -38, -121], [-60, 1]]

SOLUTION: [38, 98, 39, 24, -38, 1]

PROBLEM: [[-59, -69, -103, -115], [-110, 77, 55, 76, 78, 58, 40], [25, -90, -121], [-23, 81, 48, -18, 8, 94, 30], [-38, 78, 31, -125, -16, -129, 91]]

SOLUTION: [-59, 78, 25, 94, 91]

PROBLEM: [[-95, -77], [-96, -94, -194, 98]]

SOLUTION:
[-77, 98]