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: [[9, 77, 13, -72], [-100, 81, -199, -3, -197, -12], [85, 59, -67, -35], [25, 93], [-80, 54], [29, 50, -184, 88, -106]]

SOLUTION: [77, 81, 85, 93, 54, 88]

PROBLEM: [[-92, 66], [-124, -75, -170, -17, 20, -164]]

SOLUTION: [66, 20]

PROBLEM: [[8, 5, -151, -135, -184], [72, -166, -134], [-41, -33, 23, -140, -179], [89, 84, -71, -158, -139, -135]]

SOLUTION:
[8, 72, 23, 89]