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: [[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]

SOLUTION: [63, -33, 43, 68]

PROBLEM: [[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]

SOLUTION: [51, 69, 92, 52, 82, 70, 65]

PROBLEM: [[54, 14, -57, -93, -125, -80, -80], [-137, -15, -63, 50, 97, -134, 54], [-35, -123, 20, -89, -198, -67], [10, -4, -169], [-6, 8, -2], [95, -184, -117, 18, -113], [-143, -61, 96, -62, -125, -135, -129]]

SOLUTION:
[54, 97, 20, 10, 8, 95, 96]