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: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

SOLUTION: [2, 72, 60]

PROBLEM: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]

SOLUTION: [95, 57, -144, 66, 54, 52, 93, 100, 21]

PROBLEM: [[-188, 39, -45, -24], [-142, -151, -95], [-89, 27, 78, 27, -50, -91, 0], [16, 88, -180], [-161, -146, -20, -41], [-105, -115, -165, 26], [-57, -166, -198], [25, -121], [-165, -102, -71, -59, 75]]

SOLUTION:
[39, -95, 78, 88, -20, 26, -57, 25, 75]