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: [[15, -109, -144], [-76, 24, -172]]

SOLUTION: [15, 24]

PROBLEM: [[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]

SOLUTION: [41, -44, 34, 86, 26]

PROBLEM: [[-96, -159, -193, -137, -54, -168, 60], [-184, -191, -33, -161, -71, 63], [-35, -174, 54, -102, -157, -36]]

SOLUTION:
[60, 63, 54]