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: [[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]

SOLUTION: [36, 86, 10, 81, 69, 41, 91, 34]

PROBLEM: [[38, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]

SOLUTION: [38, 25, -7, 1, 40, 92, 87, 76, -95]

PROBLEM: [[84, -23, -156, 65], [33, -187, -187, -179], [45, -17, -171, -156, 24, -190, -151], [55, -183], [-62, 97, 44, -137, -71, -116], [8, -196, -84, 53]]

SOLUTION:
[84, 33, 45, 55, 97, 53]