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: [[-178, 31, -89, -67, 55, -105], [-18, 92, -9, 69, -95, 92], [-95, 45], [-127, 57], [41, -37, 33, 41], [-72, -74, -86, -183, 86, 31], [35, -121, -199], [-165, -69, 85, -172], [14, 85, -46, -140, 25]]

SOLUTION: [55, 92, 45, 57, 41, 86, 35, 85, 85]

PROBLEM: [[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]

SOLUTION: [91, 100, 86, 84, 13, 53, -32, 54]

PROBLEM: [[83, -123, 65, -100, -87, -130], [-182, -70, 55, -175, 56, -100], [-94, 75, -116]]

SOLUTION:
[83, 56, 75]