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: [[-117, -110, 36, 18], [-15, 40, -140], [-33, 79, 8, 42, -4, 84]]

SOLUTION: [36, 40, 84]

PROBLEM: [[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]

SOLUTION: [87, 7, 73, 69, 96, -106, 48, 84]

PROBLEM: [[-162, 59, -144, 95, -11, 57, -148], [-155, -128, 99, -57, 2, 47], [-87, -39, -136], [-158, -175, -88], [-48, -96, -139]]

SOLUTION:
[95, 99, -39, -88, -48]