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: [[-81, -174, -79], [6, -131, -75, 40]]

SOLUTION: [-79, 40]

PROBLEM: [[22, -103, -72, 64, -186, 91], [-124, -138, -193, 78], [-198, -127, -45, -129, -10, -132, 41]]

SOLUTION:
[91, 78, 41]