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: [[-11, -151], [-190, -66, 69], [-25, -118, 63, 57, -157, -78, 79]]

SOLUTION: [-11, 69, 79]

PROBLEM: [[-164, -116, 72, -85, -114, -180, -11], [-181, -28], [-161, -96, -12], [-189, -104, -138, 78, 89]]

SOLUTION:
[72, -28, -12, 89]