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: [[99, 11, 61, -95], [-186, -124, -20, -125], [-50, 93, -17], [-165, 56, 52, -142], [-88, -46, -178, -37, -126, 24], [84, 100, 18, 71, -135, 44, 96]]

SOLUTION: [99, -20, 93, 56, 24, 100]

PROBLEM: [[-117, -191, 74, -91, 71], [-175, -177], [67, 65, -160], [-98, -28, -119, -66, 29, 7, -106], [-7, -132, -151], [-139, -163, -10, 40, 81]]

SOLUTION: [74, -175, 67, 29, -7, 81]

PROBLEM: [[43, 25, -166, -52, -126], [25, -50, -129, -125], [88, -122, -70, -33, 49, 38, -108], [-160, -121, -166, -164, 66, 54, -140], [-78, 38, 17, -33, -191, 80, -137], [-133, -9, -107, -118, 31]]

SOLUTION:
[43, 25, 88, 66, 80, 31]