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: [[-110, -122, -29], [-125, 57, 69], [1, -181, -129, -60, -67], [-172, -26, -65, -102, -124, 54], [52, -39, -177]]

SOLUTION: [-29, 69, 1, 54, 52]

PROBLEM: [[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]

SOLUTION: [-18, 95, 50, 81, 49, 91, 94, 59]

PROBLEM: [[-68, 7, -57, -82, 41], [-179, -98, 31], [7, 43, -105], [81, -119, -126, 36], [-49, -124, 98, -98], [-131, 81, -73]]

SOLUTION:
[41, 31, 43, 81, 98, 81]