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: [[83, 58], [1, -44, 39, 96, -139], [-177, -38, -191, -176, -173], [74, -94, -36], [-117, 29, -68, -191, 50, -102], [-73, -137], [51, -72], [85, -159], [-130, -191, -111, -94, -124, -199, -26]]

SOLUTION: [83, 96, -38, 74, 50, -73, 51, 85, -26]

PROBLEM: [[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]

SOLUTION: [90, -12, 100, 6]

PROBLEM: [[-140, -111, 66], [-115, -45, -50, -182, -180, -160, 12], [32, -119, 98], [64, -22, -56], [-189, -160, -56], [-16, 39, 72, 30, -68, 74, 23]]

SOLUTION:
[66, 12, 98, 64, -56, 74]