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: [[-150, -68, 94, -20, -105], [-115, -107, -200, -174], [43, -27, -166, -123, 34, -161, -73]]

SOLUTION: [94, -107, 43]

PROBLEM: [[-27, -161, -136, -179, 3, 71], [1, -149, -8, -92], [68, -153, 22, -72, -132], [-185, -152, 90, 8, -112, -67, 97]]

SOLUTION:
[71, 1, 68, 97]