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: [[-80, -194], [-27, -106, -119], [-185, -153, -114]]

SOLUTION: [-80, -27, -114]

PROBLEM: [[-50, 43, 3], [53, -199, 72, -60], [-135, 10, -186, -112], [92, -118, 88, -13, -183, -152, -20], [-173, -114, 85, -130, -153], [-186, -104], [-153, -52, -33, 41, -117, 16, -188], [-77, -47, -26, 19, -93]]

SOLUTION: [43, 72, 10, 92, 85, -104, 41, 19]

PROBLEM: [[-165, 9, -111, -190, 24, -162, -89], [-36, 51, -79, -122], [54, -8, 33, -56, -26], [47, -49], [-187, -99, -127, -8, -46], [72, -108, 82, -50, -87, -28], [-31, 31, -6, 68, 1, 90], [89, -175, -69, -116, 96], [-143, 35, -104, 0, -73]]

SOLUTION:
[24, 51, 54, 47, -8, 82, 90, 96, 35]