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: [[7, 12], [-173, 15, -64, -64, -10, 54], [87, 73, -93, -48, -75, -135]]

SOLUTION: [12, 54, 87]

PROBLEM: [[-40, 4, -3, -194, -125], [95, 1, 18, -58, -130, -124, -150], [-128, 28, -80, -152, -186], [51, -199], [-75, -172, -90, -149, -142], [-137, 76, 47, 70], [-58, 64, 4, -194, -169, -16, -107], [9, -57]]

SOLUTION: [4, 95, 28, 51, -75, 76, 64, 9]

PROBLEM: [[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]

SOLUTION:
[78, -56, -80, 89, -112, 49, -93, 91, -94]