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: [[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]

SOLUTION: [58, 54, 100, 65]

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: [[99, -101, -88, 15, -73], [38, -143, -93, 43, -104, 48], [-39, -90, 31], [-146, 49, -10, 77, -49, -177]]

SOLUTION:
[99, 48, 31, 77]