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: [[-21, -117, 34], [-98, -30], [-138, 37, -165], [31, 55, -180, -96], [-5, 85, -58], [-180, 61]]

SOLUTION: [34, -30, 37, 55, 85, 61]

PROBLEM: [[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]

SOLUTION: [100, 3, 97]

PROBLEM: [[-89, -111, -193, 18, 77, -180], [-182, 52, -35, -47, -137]]

SOLUTION:
[77, 52]