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: [[42, -42, -94, 25, -125], [-141, -138, -170, -87, -121]]

SOLUTION: [42, -87]

PROBLEM: [[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]

SOLUTION: [98, -44, 98, 19, -1, 50, 98, -17, 48]

PROBLEM: [[49, -124, 19, -12, -108, -140], [-16, 66], [-27, -65], [-73, 37, 50]]

SOLUTION:
[49, 66, -27, 50]