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: [[-45, -38], [-74, -64, -89], [-113, 74, 59, -86], [28, 57, -77, -99, 95], [-193, -88, -89, 85]]

SOLUTION: [-38, -64, 74, 95, 85]

PROBLEM: [[75, -154, -179, -44], [-46, 5, -27, -68, -112], [-200, 64, 56, -97, -109, -152, 96], [-129, -77, 58, -70], [29, 93, -138, -195, -141, 72, -181], [-133, -49, -200], [-5, -144, -95, -91, -99], [82, -69], [-195, -120, -86, -177, 30, 22, 92]]

SOLUTION: [75, 5, 96, 58, 93, -49, -5, 82, 92]

PROBLEM: [[-118, -191, -190, -32], [75, -182, -177, -117], [-12, 65, -162, 74, -31], [99, -83, -114, -42, -178, -110, -23], [-137, -99, 10, -144, 51], [-133, 1, -81, -49], [-10, -189, 16, -148], [50, -53, -110, -152, -38, -187]]

SOLUTION:
[-32, 75, 74, 99, 51, 1, 16, 50]