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: [[-173, -4, 13, -117, 69], [82, -51, -156, 13], [7, 97, 15, -3, -140, -118, -195]]

SOLUTION: [69, 82, 97]

PROBLEM: [[-40, -40, 89, -120, 33], [-157, -13, 7, 45], [35, -131, 87, -23], [-125, 77, 68, -106, -2], [89, -90, 15, -2, 42, -95, 72], [-4, -179], [-119, -79], [41, -12, -110]]

SOLUTION: [89, 45, 87, 77, 89, -4, -79, 41]

PROBLEM: [[12, 40, -58, -185], [-82, -156, 76, -181, -125, -165, -84], [-97, -131]]

SOLUTION:
[40, 76, -97]