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: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]

SOLUTION: [83, 79, 34, 49, 11, 75, -6, 67, -96]

PROBLEM: [[-26, -102, -136], [-24, 31], [-27, -127, -134, -71], [94, -98], [-150, -182, 69, 59], [47, -49, -92], [-155, 55, -81, -194], [-8, -35]]

SOLUTION: [-26, 31, -27, 94, 69, 47, 55, -8]

PROBLEM: [[-18, -189, -127], [-8, 62, -141, -27, -60, -133]]

SOLUTION:
[-18, 62]