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: [[-65, -80], [-56, -98, 43, -194], [-152, -199, -81, -153, -164, -184, 97]]

SOLUTION: [-65, 43, 97]

PROBLEM: [[25, 22, 14, -95], [-48, -20, -187, 29, -172, -188, 54], [-66, -45], [64, 76, -182, 0, 79, 30], [21, -174, 96, -43, 23]]

SOLUTION: [25, 54, -45, 79, 96]

PROBLEM: [[-189, -139, 78, -81, -191, -68], [-111, -196, -26, 29], [64, -185, -163, 64, -103, 31, -174], [-83, 75, -90, -30, -184, 89], [69, -116, -105, -7], [16, 26, -122]]

SOLUTION:
[78, 29, 64, 89, 69, 26]