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: [[78, 11, 69, -139, 60, -155, -126], [-8, 1, -98, 2, -45, -50, -53], [43, 18], [-144, -9, 74, 33, -83], [40, -125, 67, 6, 51, -145, 24], [31, 26, -4, -124, -87], [-58, -79, 40, -146], [91, -168]]

SOLUTION: [78, 2, 43, 74, 67, 31, 40, 91]

PROBLEM: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]

SOLUTION: [75, 57, 75, 20, -95, 20]

PROBLEM: [[-158, 38, -158, 70], [-15, -45, -182, -166, -127], [-95, 21, -51, 10, -29], [-170, -109, 64, -38, 52, 97], [-22, 49]]

SOLUTION:
[70, -15, 21, 97, 49]