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: [[20, 65, 13, -95, -32, -125, -94], [-133, -105, -155], [20, 61, -12, 47], [71, 82, 50, -151, -30], [-1, 80, 98, 2, -145, -21, -67]]

SOLUTION: [65, -105, 61, 82, 98]

PROBLEM: [[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]

SOLUTION: [60, 26, 61, 74, -28]

PROBLEM: [[61, 84, 56, 79, -138, -28, 71], [-63, 85, -183], [-47, 98], [-158, -186], [3, 24, 58, -31, -183, -186], [-19, -73, -66, 87, -164, -72], [-85, -29, -8]]

SOLUTION:
[84, 85, 98, -158, 58, 87, -8]