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: [[82, -5, -106, 4], [92, -200, -78], [-93, -181, 63, 63], [15, -137, 27, -139], [-155, -26, -164, -24], [-98, -91, -127], [-127, -21, 47, 19, -190, 44]]

SOLUTION: [82, 92, 63, 27, -24, -91, 47]

PROBLEM: [[-163, -60, 37, -195, -36, 3], [-32, 75, -1]]

SOLUTION: [37, 75]

PROBLEM: [[-121, -115, -14, -155, 28, 96], [18, -92, 100, 32], [-143, 73, -179]]

SOLUTION:
[96, 100, 73]