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: [[93, 55, 18, 28, -87, -59], [-181, 6, -163, -78, 17], [70, -41, 36, 78, 67, -180], [-180, 84, 59], [-155, 35]]

SOLUTION: [93, 17, 78, 84, 35]

PROBLEM: [[36, 69, -9, 74], [-30, -109, -191, -183, 32], [-164, -76, -168, -55, 17], [-35, -101], [-108, -139, -135, -140, 2, -96], [-170, 74, -30, -39], [-87, 56, -119, -176, -57, -182]]

SOLUTION:
[74, 32, 17, -35, 2, 74, 56]