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: [[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: [[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]

SOLUTION: [74, 78, -132, 63, 73, 39]

PROBLEM: [[-29, -11, 24], [48, -176], [-159, -49, -55, -186, 2, -143, -199], [-91, -164, -58, 1, -28], [-28, -18, -53, -63, -145, 18, -19]]

SOLUTION:
[24, 48, 2, 1, 18]