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: [[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]

SOLUTION: [-63, 82, 79]

PROBLEM: [[-56, 1, 91, 72, -43, 93, 97], [82, -37, 68, 90, -1], [-77, -107, -45, -85, 93], [48, -60, -115, -121, 52, -56, -173], [-75, -154, 52, -51, -70], [-133, -87, -29, -183, -168], [37, -115, -149, -51], [-168, -135, 79], [-46, 13, 24, -91, -91, 80]]

SOLUTION: [97, 90, 93, 52, 52, -29, 37, 79, 80]

PROBLEM: [[-29, 31, -182, -122], [-156, -48, -103], [-149, 94, -139, -140], [68, -114, 25]]

SOLUTION:
[31, -48, 94, 68]