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: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]

SOLUTION: [83, 79, 34, 49, 11, 75, -6, 67, -96]

PROBLEM: [[-44, 69, 61, 24, -52], [-136, 9], [-111, -10, -70, -123, -126, -30, -199], [-164, -156], [6, 91]]

SOLUTION:
[69, 9, -10, -156, 91]