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: [[-117, -110, 36, 18], [-15, 40, -140], [-33, 79, 8, 42, -4, 84]]

SOLUTION: [36, 40, 84]

PROBLEM: [[-77, 69], [35, -21, 65], [-182, -70], [-183, 51, -62, 34, -54, -137, 55], [46, -178, -122, -50, 32, -162, -132], [-9, -196, -1, -76, -36, 38]]

SOLUTION: [69, 65, -70, 55, 46, 38]

PROBLEM: [[26, 37, -99, -182, -20], [22, 83, -5, -168, 84, -1, -114], [-141, -67, 28, -95, -148, 54], [12, -60, 80, 73], [67, -67, -188, -125]]

SOLUTION:
[37, 84, 54, 80, 67]