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: [[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]

SOLUTION: [-3, 50, -38, 51, 42, 54, 81, 76]

PROBLEM: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]

SOLUTION: [-61, -68, -103, 97]

PROBLEM: [[-28, -4, -50, 35], [-74, -41, 71], [44, 68, -108, 92, -134], [-169, -159, -131, 67, 38, -124]]

SOLUTION:
[35, 71, 92, 67]

