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: [[-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: [[-2, -59, -139, -19, -120], [-148, 59, 73, -148, 27], [94, -73, -135, 45, -75, 23], [81, -132, 2, -132, 49]]

SOLUTION: [-2, 73, 94, 81]

PROBLEM: [[97, -199, -8], [-200, 56, -40, 27, -158, -108, 43], [-8, -26, -50, -137, 27], [94, -198, 24, -79, -43]]

SOLUTION:
[97, 56, 27, 94]