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: [[-152, -12], [10, -52], [-104, 77], [73, -72, 72]]

SOLUTION: [-12, 10, 77, 73]

PROBLEM: [[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]

SOLUTION: [52, 80, 98, 38, 69, 81, 8, 64]

PROBLEM: [[-199, 21, 7], [24, 83, -163, 85]]

SOLUTION:
[21, 85]