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: [[-122, -18], [-126, -168, -62], [-185, 20, -166, 59, -185, -181, -174], [-32, -105, 14, -182], [91, 95], [-12, -124, 4, -192, -101, -200, -69], [-49, -113, 94, 50], [23, -25], [92, -139, -21, -136]]

SOLUTION: [-18, -62, 59, 14, 95, 4, 94, 23, 92]

PROBLEM: [[67, 44, 35, 59], [-191, -183, -154, 76, -98, -165], [50, 63], [72, 30]]

SOLUTION: [67, 76, 63, 72]

PROBLEM: [[-197, 96, -154, -173, -55, -70], [-28, -119, 20, -38, -166], [-130, 44, 41, 47, 62, 51], [-14, -185, -128]]

SOLUTION:
[96, 20, 62, -14]