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: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]

SOLUTION: [58, 19, 68]

PROBLEM: [[95, -100, -10], [-52, -130, -16, -86, -37, -181], [-126, -10, 3, -135, -67, 64, -5], [-101, -96, -155, -12, -63], [-130, -187, 20, 45], [-176, 87, -135, -75, -90, -189, -200], [-53, 74, -52, 29, -150], [-192, 48, -15, -148, -175], [75, -148]]

SOLUTION: [95, -16, 64, -12, 45, 87, 74, 48, 75]

PROBLEM: [[-40, -195, 50], [10, -47, -3, -144, -62, -113, -15], [21, -152, -33, -135, -56], [-51, -70, 80, -118, -13, 7, 58], [-155, -140, -1], [-135, -147, -33, 77, -120], [78, -157, -6, -29, -180], [-172, 7, 53, 25, 55, -155, -166]]

SOLUTION:
[50, 10, 21, 80, -1, 77, 78, 55]