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: [[-92, -7], [1, -45], [53, -66, 54, -79, 17, -157, -142], [-9, -143, 9, -59], [-14, -179, -102, -29, -37], [-122, -171, -56, 94], [14, -199], [-83, -87]]

SOLUTION: [-7, 1, 54, 9, -14, 94, 14, -83]

PROBLEM: [[-47, 14, -38, -87], [56, -64, 73, -151]]

SOLUTION:
[14, 73]