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: [[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

SOLUTION: [-55, 98, -27]

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: [[-30, -123], [-153, 72, -27, 73, -60, -5], [-69, 47, 91, -133], [-81, 81, 67, -148, -104], [-79, 69, 80, 98, 81, 32], [54, -39]]

SOLUTION:
[-30, 73, 91, 81, 98, 54]