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, -57, 13, -41], [45, -68, -199]]

SOLUTION: [13, 45]

PROBLEM: [[-58, 41, -14, -59, -168, -150, 61], [-110, -158, 28], [-109, 5, -79, -55, 95, -140], [8, -194, 9, -19, -121]]

SOLUTION: [61, 28, 95, 9]

PROBLEM: [[-44, -183, -51, -98], [-17, -142, -149], [-26, 54], [36, 79, -46, -65, -195, -31, 79], [30, 38, 89], [-160, -91, -117, -17, -125, -66]]

SOLUTION:
[-44, -17, 54, 79, 89, -17]