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: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]

SOLUTION: [12, -16, 41, 50]

PROBLEM: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]

SOLUTION: [91, 53, 82, -9]

PROBLEM: [[-146, -120], [-98, 64], [4, -171, 74, -88, -132, -50], [-13, -53, -180, -23], [4, -100, -157, 46], [-148, 49, 69], [-57, -169, -42, 73]]

SOLUTION:
[-120, 64, 74, -13, 46, 69, 73]