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: [[-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: [[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]

SOLUTION: [75, 34, 96, 33, 21, 50, 17]

PROBLEM: [[-167, 57, -30, -166, 3, -179, 59], [-63, -59, 34], [47, 10], [-17, 91, -13, -196], [-65, -170, -191, 68]]

SOLUTION:
[59, 34, 47, 91, 68]