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: [[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]

SOLUTION: [53, 41, 80, 98, 91, 62]

PROBLEM: [[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]

SOLUTION: [63, 2, 29, 18, 98]

PROBLEM: [[95, -191, -82, -124, -128, -126], [76, -47], [-154, -106, 12, 14, -165]]

SOLUTION:
[95, 76, 14]