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: [[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]

SOLUTION: [0, -131, 75, 100, 90, 95, -24, 13, 10]

PROBLEM: [[-4, -182, -138, -178, -83], [-103, 59, 7, -131, -76, -165, 3], [-79, -183, 91, -170, -5, 75], [-87, 13, -84], [-167, -109]]

SOLUTION:
[-4, 59, 91, 13, -109]