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: [[-29, -139], [-113, 72, 88, -95, -146, -186], [31, -151, -171, -180, -87, -12, -181]]

SOLUTION: [-29, 88, 31]

PROBLEM: [[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]

SOLUTION: [71, 44, 78, 87, 68, 91]

PROBLEM: [[18, 20, -166, 39], [2, -16, -183, -68, -143], [2, -103, -160, 91, -58, -3, -130], [-165, -18, -87], [-83, -51]]

SOLUTION:
[39, 2, 91, -18, -51]