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: [[59, -66, -98, -64, -117, -128, -189], [-170, -12], [-25, -110]]

SOLUTION: [59, -12, -25]

PROBLEM: [[-110, -122, -29], [-125, 57, 69], [1, -181, -129, -60, -67], [-172, -26, -65, -102, -124, 54], [52, -39, -177]]

SOLUTION: [-29, 69, 1, 54, 52]

PROBLEM: [[38, -36, -58], [-110, -161, 94], [-14, -40, 6, 70, -153]]

SOLUTION:
[38, 94, 70]