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: [[-82, -50, 44, -81, 8, -40, -47], [57, -72, 38, 1, -158], [-7, -143, -15, 55, 2], [67, 50, 78, 15, 77], [5, -174, -101, -40, 8], [-38, -10], [-45, -138, -140, 13, -76, -37]]

SOLUTION: [44, 57, 55, 78, 8, -10, 13]

PROBLEM: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]

SOLUTION: [-26, -3]

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]

