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: [[54, 83, -51, -150, -2, -16, -46], [-55, 91, -47, -111], [-31, 46, -124, -178, 21, -17, -72], [53, -71], [-122, -122, -119, -33, 6, 29], [-42, 77, 27, -38, -20], [22, -22, -81, -136, 52, -50, -125], [-119, -115, -194, -102, -200, -68, -186], [-33, -105, -155]]

SOLUTION: [83, 91, 46, 53, 29, 77, 52, -68, -33]

PROBLEM: [[-18, 44, 37, -24], [-56, -127, -121, -102, -189, -43, -175], [-108, -188, 93, -46, -6], [4, -164, 23, 16], [-179, 9, -58]]

SOLUTION: [44, -43, 93, 23, 9]

PROBLEM: [[-98, -179], [-76, -91, -4], [-90, -150, 11, -146, -52], [64, -121, 45, 85, -49], [-105, -115, 76, 5, 56, 92, -128], [58, -24, -65, -3, -105], [-82, 72, 84, -197, 82], [97, -159, -191, 47, -180, -127], [-176, -148, 41, 40]]

SOLUTION:
[-98, -4, 11, 85, 92, 58, 84, 97, 41]