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: [[-45, -1, -51], [-156, -12, -52, -85, -77, -21, -82], [-134, -82, -110, -168], [-118, -182, -74], [21, -44, 78]]

SOLUTION: [-1, -12, -82, -74, 78]

PROBLEM: [[45, 77, -108, -15, -54], [-159, -32, -74, 20, -167, -25, -2], [-100, -19, -143, 78], [63, -90, -69, 69, -29], [-115, -56, 77, -78, 8, -111], [-194, -63, -141, 8, 24], [-56, -125, -5], [45, -68, -6, -196, 12]]

SOLUTION: [77, 20, 78, 69, 77, 24, -5, 45]

PROBLEM: [[-83, -153, -37], [-169, 94, -10, -45, -164, -74], [-57, -162, 68, -96, -94, -10], [66, -109, -46, -25, -4, -193, -9]]

SOLUTION:
[-37, 94, 68, 66]

