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: [[57, 1, -116, -74, 72, -86], [-19, -44, -181, 89, -174, 39, 96], [-170, -82, -59, 83]]

SOLUTION: [72, 96, 83]

PROBLEM: [[14, -64, 78], [-36, -133], [-17, 49, -19, -14], [-140, -55, 35]]

SOLUTION: [78, -36, 49, 35]

PROBLEM: [[91, 72, -163, 73, -191, 87, -141], [-155, -164, 78, -147, -88], [-153, -80, -21], [44, -186, -119], [-146, -159, -18, -183, 45, -182, -198], [-120, -92, -154, 87, -171, 57], [-143, -108, -155], [-96, -96, 94], [67, 93, -132, -125, -158]]

SOLUTION:
[91, 78, -21, 44, 45, 87, -108, 94, 93]