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: [[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]

SOLUTION: [98, -11, 98, 26, 10]

PROBLEM: [[-37, 85, -37, -156], [82, -161, -84, -172], [-126, -35, -39, -130, -200]]

SOLUTION: [85, 82, -35]

PROBLEM: [[-82, 80, -27, 1, -152, -108, -118], [-1, 92], [-20, -95, -70], [13, -125, -183, -106, -8, 6], [20, -146, 55, -177, -32], [-85, -148, -5, -118, -167, -196]]

SOLUTION:
[80, 92, -20, 13, 55, -5]