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: [[-57, -10, -27, -160], [-80, -130, -16, 25], [-65, -106, 30, -104, -20, 77], [-192, -87, -49, 64, 43, 94, 82], [-81, -10, 20, -28, 79, 73, -1], [-191, -83, -113, 40, 6]]

SOLUTION: [-10, 25, 77, 94, 79, 40]

PROBLEM: [[-40, -40, 89, -120, 33], [-157, -13, 7, 45], [35, -131, 87, -23], [-125, 77, 68, -106, -2], [89, -90, 15, -2, 42, -95, 72], [-4, -179], [-119, -79], [41, -12, -110]]

SOLUTION: [89, 45, 87, 77, 89, -4, -79, 41]

PROBLEM: [[20, -72, -183, -96, 46, -166, -171], [-177, -39, -166], [-26, -4, -169, 66, -30, -68, -48], [33, -184, -112, -105, -93, -178, -199], [-42, 10, 81, -169], [0, -165, -74], [-50, 75, -67, -70], [-112, -24, -163, -14, -62, 54, 49], [-79, 53, 68, -194, -80, 92]]

SOLUTION:
[46, -39, 66, 33, 81, 0, 75, 54, 92]