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: [[-31, -48], [7, -142, -76]]

SOLUTION: [-31, 7]

PROBLEM: [[78, 47, -92, -13], [-96, -82, -2, -121, -170, 97], [-25, 34, -96, -66, -40, 65], [-13, 35, -59, 100, -164], [-39, -131], [-7, -166, -29, 22, -3, -100, -72]]

SOLUTION: [78, 97, 65, 100, -39, 22]

PROBLEM: [[-156, 5, 6, -66, -100, -29, -60], [-116, -182, -27, -13, -169, -125], [-60, -111, 94, 24, -190, 40]]

SOLUTION:
[6, -13, 94]