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: [[-38, 56, -23], [-19, -178, -59]]

SOLUTION: [56, -19]

PROBLEM: [[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]

SOLUTION: [74, 78, -132, 63, 73, 39]

PROBLEM: [[-153, 88], [-166, -51, 31], [-142, -73, -181, -112]]

SOLUTION:
[88, 31, -73]