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: [[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]

SOLUTION: [92, 46, 25, 19]

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: [[46, 53, -131, 7, -130], [-192, 71, 80, 20, 97, 3, 14], [-77, -136, 82, -56, 71, -116], [38, -38, 75, -98, 87], [36, -125]]

SOLUTION:
[53, 97, 82, 87, 36]