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: [[96, -52, 68, -142], [-73, -61, -136, -199, 2], [-76, -160, -80, -125, -52, 19], [59, -116, -112, -40, -22], [-16, 43], [-187, 28, -125, -154, -93, -133, 38], [-46, -200, -124, -158]]

SOLUTION: [96, 2, 19, 59, 43, 38, -46]

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: [[-166, -120, 100, -119, 83], [-142, -79], [75, -8, -78, -190, -117]]

SOLUTION:
[100, -79, 75]