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: [[-161, 54], [-41, 74], [74, 84, -87, 28, -181], [-44, 9, 40, -67, -193]]

SOLUTION: [54, 74, 84, 40]

PROBLEM: [[50, -99, 52, -39, -139, 57, -66], [-50, 61, -23, -169, -153, -162, -81], [-165, -194, 36, -100, -200, -81], [-83, 78, -200, -49, -96]]

SOLUTION: [57, 61, 36, 78]

PROBLEM: [[59, 41, 54, -135, -145, -187, 90], [83, -140, -173], [-129, 22, -50, -144, 44], [-8, -94], [93, 89, -196, -155], [-61, -164, 73, -40, -183, 100, -89], [-60, -190], [-147, -91, 24]]

SOLUTION:
[90, 83, 44, -8, 93, 100, -60, 24]