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: [[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]

SOLUTION: [40, 84, 55]

PROBLEM: [[-18, -29, 4, 70, -1, 66], [-63, -199], [-128, 88], [-80, -95, -40, 51, -97], [-55, -200, -186], [-103, -104, -9, -179, 93, -82, -129]]

SOLUTION: [70, -63, 88, 51, -55, 93]

PROBLEM: [[-50, -183, -184, 44, 71], [-60, -38], [-173, -157, -32, -135, 5, 29], [-176, 96, -148, 66], [-99, -153, -181, -158], [44, -51, -10, -101, -152]]

SOLUTION:
[71, -38, 29, 96, -99, 44]