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: [[-92, -7], [1, -45], [53, -66, 54, -79, 17, -157, -142], [-9, -143, 9, -59], [-14, -179, -102, -29, -37], [-122, -171, -56, 94], [14, -199], [-83, -87]]

SOLUTION: [-7, 1, 54, 9, -14, 94, 14, -83]

PROBLEM: [[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]

SOLUTION: [100, -120, -94, 63, 50, -139, 80, 56, 88]

PROBLEM: [[-105, 13], [-13, -20, 15, -75, -185, -145, -181]]

SOLUTION:
[13, 15]