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: [[57, 81, -73, 26], [-40, -99, 67, -180, 25], [75, 86, -116, 56, -141, -111], [-127, 59, -108, -86, -63, 24, -144], [-9, -161, 75, 26]]

SOLUTION: [81, 67, 86, 59, 75]

PROBLEM: [[43, -158, 27, -169, -144, 35], [-73, -173]]

SOLUTION: [43, -73]

PROBLEM: [[-14, -100, -2], [-144, -21], [-52, -29]]

SOLUTION:
[-2, -21, -29]