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: [[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]

SOLUTION: [79, 56, -1, 85, 89, 61, -62, 31]

PROBLEM: [[-81, -174, -79], [6, -131, -75, 40]]

SOLUTION: [-79, 40]

PROBLEM: [[-170, -147, 95, -135], [-150, 77, -85, -75, -117, -100], [-39, 95, 94, -105], [21, -89, -188], [-112, -159, 7, 81], [-192, 31, -167, -68, -186], [70, 100], [31, 21, -85, -166, 59, -144, -31], [-63, 33, -141, -86, 15, -140]]

SOLUTION:
[95, 77, 95, 21, 81, 31, 100, 59, 33]

