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: [[-15, 93, -70, -39], [-157, -29, 74, -14, -155], [74, -176, -85, -143, 4, 0, -25]]

SOLUTION: [93, 74, 74]

PROBLEM: [[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]

SOLUTION: [81, 84, -3, 93, -41, 21, 6, 87, -16]

PROBLEM: [[-129, -121, -62, -70, 31], [92, 63], [-38, 99, -156], [100, 66], [-89, -152, -11, 38], [-106, -69]]

SOLUTION:
[31, 92, 99, 100, 38, -69]