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: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]

SOLUTION: [91, -49, 89, 83, 92, -91]

PROBLEM: [[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]

SOLUTION: [96, 48, 65, 19, -26, 95, -11]

PROBLEM: [[28, -121, -1, 12], [32, 79, 6], [-25, 53, 57, 8, -7, -58], [-62, 11, -177, -65, 53, 17, 78], [-173, -144, 3, -146]]

SOLUTION:
[28, 79, 57, 78, 3]