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: [[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]

SOLUTION: [66, 16, 16, 69, 12, 80]

PROBLEM: [[-4, -186, 89, 50, 100, 24], [-135, -17, -4, 79, -42, -145], [-196, -130], [82, 74], [-187, 7, -164, -163, -109], [90, 76, -16, 13, 6, 89], [-89, 46]]

SOLUTION: [100, 79, -130, 82, 7, 90, 46]

PROBLEM: [[-130, -154, -131, -148, -123, -57, -124], [-110, 43, 42, 62, 66]]

SOLUTION:
[-57, 66]