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: [[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]

SOLUTION: [79, 65, -87, 89, -2, -13, 20, -184]

PROBLEM: [[-2, -170, -178, -115], [52, 57, -200, -86, 14, 31, -19], [-121, 20, -2, -173, -85, -115, 97], [30, -119, -33], [-40, -53, 24, -133, -196]]

SOLUTION: [-2, 57, 97, 30, 24]

PROBLEM: [[-153, -30, 73, -130, -159], [35, 4, -105], [-109, -104, 22, -66]]

SOLUTION:
[73, 35, 22]