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, 100, 36, -80, 90], [-117, 80, -105, 86], [45, -168, -148, 87, -195, -102]]

SOLUTION: [100, 86, 87]

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: [[-188, 70, 57, 23, -119], [-154, 29, 75]]

SOLUTION:
[70, 75]