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: [[-106, 56, 90, 76, 6, -169], [-10, -187, 27, 59, 94, 85]]

SOLUTION: [90, 94]

PROBLEM: [[86, -51, -86], [-142, -15, 23, 8, -51, 35], [-107, -158], [16, 61, 44, -38, -51]]

SOLUTION:
[86, 35, -107, 61]