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: [[-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: [[-46, 14, -141, -77, -62], [-183, -86, -115], [-146, -60, 34], [-42, 19, -101, -49, 47], [-117, -174]]

SOLUTION: [14, -86, 34, 47, -117]

PROBLEM: [[-95, 73, -103, -100], [-98, -95], [-67, -69, -192, -19, 73]]

SOLUTION:
[73, -95, 73]