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: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]

SOLUTION: [60, -32, 68, 93, 24, 26, 7, 85]

PROBLEM: [[-13, -42, 79], [10, -6, 24, -174, -92], [65, 8, -120, -166, 36], [-181, 25, -196, -180, -44], [-38, 72, 84]]

SOLUTION: [79, 24, 65, 25, 84]

PROBLEM: [[-107, -116, -200], [-4, -22], [-197, -166, 27, -128, 59], [100, -63, 74, -51, -47, -162], [95, 8, -62], [-74, -98], [92, -118, -183, -33]]

SOLUTION:
[-107, -4, 59, 100, 95, -74, 92]