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: [[78, 47, -92, -13], [-96, -82, -2, -121, -170, 97], [-25, 34, -96, -66, -40, 65], [-13, 35, -59, 100, -164], [-39, -131], [-7, -166, -29, 22, -3, -100, -72]]

SOLUTION: [78, 97, 65, 100, -39, 22]

PROBLEM: [[-8, 77], [36, 58]]

SOLUTION: [77, 58]

PROBLEM: [[-102, -3, -124, -45, 83, 6, -167], [-35, -156, -156, 81, -33, -197, 79], [2, -82, 60, 15, -175, 62, 72], [-39, -187, -104, -112, 77, 62, 55], [47, -165, -177, 11, -176, -4], [-91, 92, -88, -113, -66], [-66, 83, 37, -146, -41]]

SOLUTION:
[83, 81, 72, 77, 47, 92, 83]