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: [[-4, 11], [12, -196, -120, 66, -157, -72]]

SOLUTION: [11, 66]

PROBLEM: [[-122, -130], [-22, 85, 73, -35], [-134, -96, 30], [49, -68, -166], [-75, -193, -193], [68, 50, -166, -111, -65, 25], [-109, 72, 22, -170, -106, -32, 66]]

SOLUTION: [-122, 85, 30, 49, -75, 68, 72]

PROBLEM: [[-29, -151, 18, -15, -20, 21], [97, 1, -57], [18, 83, -60, -178, -78, -126, 89]]

SOLUTION:
[21, 97, 89]