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: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]

SOLUTION: [67, 90]

PROBLEM: [[-67, 92, 59, -49, -22, -8], [-65, 28, -120, -118, -63, -19, -160], [10, 46, -37, 65, -184, 99, 52], [-18, 15, 6]]

SOLUTION: [92, 28, 99, 15]

PROBLEM: [[-21, -17, -178, 61, -92, -68], [-171, 1, -185, 17, -19, 4, -95]]

SOLUTION:
[61, 17]