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: [[-4, -199, -162, 33], [25, -194, -157, -39, -122, 100, -108], [-25, -181, 74, -116, -119], [69, -124]]

SOLUTION: [33, 100, 74, 69]

PROBLEM: [[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]

SOLUTION: [-121, 80, 98, 56, -17, 10, 55]

PROBLEM: [[-157, 33, 92, -112, 87], [-77, -145, 21, -112, -120, -109, 100], [0, -103, -165, 54, -189, 83, -197]]

SOLUTION:
[92, 100, 83]