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: [[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]

SOLUTION: [90, -12, 100, 6]

PROBLEM: [[-139, -177], [-69, 92], [69, -10, -53, 2, -46, -139], [-78, -50, 16, 96, -177]]

SOLUTION: [-139, 92, 69, 96]

PROBLEM: [[-89, -89, -146], [-30, -53], [79, 50, 32, -179]]

SOLUTION:
[-89, -30, 79]