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: [[-92, 82], [-90, 37], [-135, -183], [-140, 37], [-156, -132, -162, -185], [28, 67, -110, -50, -53]]

SOLUTION: [82, 37, -135, 37, -132, 67]

PROBLEM: [[-8, -192, -5, 80, -70], [62, 32, 55, 3, 50, 63], [21, -193, 76, 64, 91], [-179, -137, 91], [-130, 10, -183]]

SOLUTION:
[80, 63, 91, 91, 10]