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: [[-56, -179, -2, -94], [-5, 31, -137, -128], [-53, -151, -60, 57, -3], [-73, 0, -54, -128], [6, -74, 55, -90], [94, -128, 94, 44, -189, -38], [-167, -129, -11, 49, -60, -66], [-123, -3, 57, -159], [-120, -178, -46, -190, -26, 9, -8]]

SOLUTION: [-2, 31, 57, 0, 55, 94, 49, 57, 9]

PROBLEM: [[-2, -170, -178, -115], [52, 57, -200, -86, 14, 31, -19], [-121, 20, -2, -173, -85, -115, 97], [30, -119, -33], [-40, -53, 24, -133, -196]]

SOLUTION: [-2, 57, 97, 30, 24]

PROBLEM: [[-176, -160], [-59, -54, 93]]

SOLUTION:
[-160, 93]