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: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]

SOLUTION: [90, 98, 22, 85, 64, 77, 63, -152]

PROBLEM: [[2, -34, -18, 14, -118], [-83, -168, -91, -189, -43, -84], [-3, -67], [-99, -66, -24, -133, 4, 14], [56, -148], [-148, 61, -10], [-105, -19, -19, -23], [-11, 97, -151, -180, -160], [-74, -14, -67, -75, -111]]

SOLUTION: [14, -43, -3, 14, 56, 61, -19, 97, -14]

PROBLEM: [[80, -177, -139], [15, -116, -92, -71], [-199, -2, -110, -167, -150], [52, -135, 56, -119, 36], [-77, -91, -140, 78, -20, 98, -113], [-149, -200, -181], [-112, -151, -71, 20], [-165, 40], [-118, -188, -172, -125, -153, -195, -76]]

SOLUTION:
[80, 15, -2, 56, 98, -149, 20, 40, -76]