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: [[-192, 95, -12, -36, 36, -180, 51], [-140, -53, -106, -125], [-118, -29, -137, 27, -192]]

SOLUTION: [95, -53, 27]

PROBLEM: [[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]

SOLUTION: [52, 39, 95, 2, -17, 57, 73, 70, 44]

PROBLEM: [[-125, -162, -99, -155, 12, 65, -184], [53, -33, -186, -178, -96, -55, 26], [71, -198, 53, -72, -39], [-60, -130, -39, -110, -155], [-161, -193], [17, -106, -80]]

SOLUTION:
[65, 53, 71, -39, -161, 17]