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: [[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]

SOLUTION: [99, 54, 32]

PROBLEM: [[-100, 17, -33, 92, -141, 80, -163], [44, -107, 86, -123, 17, -17], [64, -86, 48], [-57, 7], [14, 1, -110]]

SOLUTION:
[92, 86, 64, 7, 14]