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: [[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]

SOLUTION: [90, -12, 100, 6]

PROBLEM: [[-79, -50, -49, 57, -110, -78, -180], [-119, -90, 40], [81, -55, -64, -19], [17, -42, -76, -136, -58], [-74, 4, -161, -72]]

SOLUTION: [57, 40, 81, 17, 4]

PROBLEM: [[-35, -129, 76, -111, 58, 34], [17, -98]]

SOLUTION:
[76, 17]