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: [[-82, -50, 44, -81, 8, -40, -47], [57, -72, 38, 1, -158], [-7, -143, -15, 55, 2], [67, 50, 78, 15, 77], [5, -174, -101, -40, 8], [-38, -10], [-45, -138, -140, 13, -76, -37]]

SOLUTION: [44, 57, 55, 78, 8, -10, 13]

PROBLEM: [[-24, 11, -145], [31, -36, -110, -193], [31, -116, -20, -36, -174, 47]]

SOLUTION:
[11, 31, 47]