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: [[77, 41, -119, -94, -64], [-129, 98], [57, -199, -120, 23, 55, -62], [-76, 55, -37, -164, 95, 75, -120], [-149, -121, -123, -133, -136, 68]]

SOLUTION: [77, 98, 57, 95, 68]

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: [[-63, -56, 42], [-131, -103, 31, 9], [-74, 74, -174], [-192, -179, 75, -106, -28, -141, -89], [-16, 96, 45, -48], [-111, -170, -145]]

SOLUTION:
[42, 31, 74, 75, 96, -111]