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: [[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]

SOLUTION: [-6, -59, 52, 14, 96, 37, 62]

PROBLEM: [[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]

SOLUTION: [65, 53, 72, -30, 85, 38]

PROBLEM: [[-106, -102, -95, -130, -80, -137], [54, 52], [-180, 21, 33, 32, -173, 0, 79]]

SOLUTION:
[-80, 54, 79]