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: [[-88, -78, -21], [-154, -184, -116, -32, -111, -121], [-14, -137, -43, -117], [-75, 38, -76, -138, -108, -102, 42], [12, -66, -91, 100, -55, 2]]

SOLUTION: [-21, -32, -14, 42, 100]

PROBLEM: [[-176, 36, 94, 7, 55, 29], [-66, 24, -23, -199, -43, -40], [-99, -187, -132, -129, 12]]

SOLUTION: [94, 24, 12]

PROBLEM: [[76, -72, -162, -43, -175], [12, -16, 3, 35, -80, -52, 91], [45, -130], [49, -184, 83, -99], [-195, -119, -17, -39, -111, 77], [49, 40, -169], [-193, -107, 74, -174, -178, -125, -60], [-62, -59, -149, -72]]

SOLUTION:
[76, 91, 45, 83, 77, 49, 74, -59]