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: [[-88, 24], [-125, -39], [95, -76, -84, -69, -190, -148], [-196, 71, -2, -91, -112]]

SOLUTION: [24, -39, 95, 71]

PROBLEM: [[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]

SOLUTION: [53, 41, 80, 98, 91, 62]

PROBLEM: [[-194, -139, -142, 65, -199], [-86, -78, 5, -154]]

SOLUTION:
[65, 5]