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: [[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]

SOLUTION: [40, 84, 55]

PROBLEM: [[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]

SOLUTION: [18, 84, -83, 96, -52, 90, 76]

PROBLEM: [[-139, -47, -107, -153], [-158, 58, -18], [57, 24, 4, -199, -51, -48, 17], [-156, 22, 83, -45]]

SOLUTION:
[-47, 58, 57, 83]