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: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]

SOLUTION: [95, 57, -144, 66, 54, 52, 93, 100, 21]

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

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

PROBLEM: [[-57, -130, -144, 18, -78, 92, -2], [-186, -1]]

SOLUTION:
[92, -1]