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: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

SOLUTION: [2, 72, 60]

PROBLEM: [[-61, -173, -114, -165, -42], [88, 66], [-180, -162, 19, -92, 91, -102, -166], [-98, -156, -21, -13], [34, -133, -111]]

SOLUTION: [-42, 88, 91, -13, 34]

PROBLEM: [[-53, 27, -29, 53, -93], [-148, -197]]

SOLUTION:
[53, -148]