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: [[99, -128, -21, -121, -117, -92], [-48, -9, -141, -18, -95], [-20, -29, -22, -193]]

SOLUTION: [99, -9, -20]

PROBLEM: [[-134, -117, -108, 57], [-70, 34, 52, -191]]

SOLUTION: [57, 52]

PROBLEM: [[-112, 66, -4, -26, -15, -171], [12, 7, 70, 33, -130, -53], [-142, -174, -126, -165, -45], [16, -99, -148, -96, -22, -54], [53, -161, -168], [-108, 80, -37, -45], [41, 12]]

SOLUTION:
[66, 70, -45, 16, 53, 80, 41]