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: [[-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: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]

SOLUTION: [95, 57, -144, 66, 54, 52, 93, 100, 21]

PROBLEM: [[28, -120, -75], [-135, -80, -142, -111, -126, -107, 88], [57, 82, -81, -68, -192, -10]]

SOLUTION:
[28, 88, 82]

