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: [[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]

SOLUTION: [18, 84, -83, 96, -52, 90, 76]

PROBLEM: [[20, 71, -57, -136, 45], [-3, -147, -182], [48, -161, 35, -16, -193], [7, 90, -78, -102], [-108, 92, 30, -147, -86, -132]]

SOLUTION: [71, -3, 48, 90, 92]

PROBLEM: [[-57, 10, -75, 38, 97, -187, 67], [-71, -68, -166, 14, -68, -38, 83], [-157, -144, -92, 8]]

SOLUTION:
[97, 83, 8]