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: [[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]

SOLUTION: [53, 41, 80, 98, 91, 62]

PROBLEM: [[-16, -86, -146, -2, 45, -193, 6], [-125, -194, 40, 86, 15, -146, -131], [-150, 75, 6, -6, -39, -138]]

SOLUTION: [45, 86, 75]

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]