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: [[-42, -57, 13, -41], [45, -68, -199]]

SOLUTION: [13, 45]

PROBLEM: [[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]

SOLUTION: [54, 44, 50, 12, 24, -28]

PROBLEM: [[-102, -116, -91, -5, -27, 74, -27], [-140, -164, 66, 37, -194, -166, 41], [3, 54, -172, -78, -56], [-24, -64, -29, 33]]

SOLUTION:
[74, 66, 54, 33]