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: [[-31, -113, -173, -37, -4, -189, -191], [-32, 92, -46]]

SOLUTION: [-4, 92]

PROBLEM: [[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]

SOLUTION: [18, 84, -83, 96, -52, 90, 76]

PROBLEM: [[10, 38, -46, -163, -64], [-112, 80, -57, 84], [-200, -148], [-51, -69, -137, -155, 78, -23, -121], [15, -43], [-116, 64], [-14, -126, 94, -64, 24, -186, -200]]

SOLUTION:
[38, 84, -148, 78, 15, 64, 94]