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: [[-81, -174, -79], [6, -131, -75, 40]]

SOLUTION: [-79, 40]

PROBLEM: [[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]

SOLUTION: [90, -4, 18]

PROBLEM: [[-21, 30], [77, -92, -76, -179], [-124, -22, 8, 37], [7, 11, -88, -53, 57], [-81, -160, -184, -14, -146], [50, 57], [-9, 36, -122, -19, 42], [-90, -120, 52], [-61, -115, -10, -130, -59]]

SOLUTION:
[30, 77, 37, 57, -14, 57, 42, 52, -10]