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: [[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

SOLUTION: [-55, 98, -27]

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: [[7, 69, -120, 43, -57], [-140, -182, -191, -138], [-166, -133, -2, -74], [-196, 37, -81, 42, -12, 21, -38], [-26, -105, -130, -153, -177, 1]]

SOLUTION:
[69, -138, -2, 42, 1]