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: [[-139, -177], [-69, 92], [69, -10, -53, 2, -46, -139], [-78, -50, 16, 96, -177]]

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

PROBLEM: [[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]

SOLUTION: [-26, 0, 75]

PROBLEM: [[16, -56, 66, -32], [-111, 28, -80, 85], [-140, -80, -19, -67, -147, -122], [-80, -198, 47, 59, -180, 99]]

SOLUTION:
[66, 85, -19, 99]