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: [[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: [[-4, -117, -177, -28, -87, -48], [-168, -118, 18, 12, -108, 83, -91]]

SOLUTION: [-4, 83]

PROBLEM: [[-146, -114, -127, -171, -63, 71], [-177, 0, 55, 48, -59, 98], [-47, -131]]

SOLUTION:
[71, 98, -47]