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: [[-72, -37, -51, 45], [-102, 17, -162, -122, -145], [-40, 31, -71, 89, 92, -3, 16], [-155, -190, 12, 3], [-2, -150, -94, 28, -52, 7], [-150, -106, 8], [-102, -174, -93, -186, -194]]

SOLUTION: [45, 17, 92, 12, 28, 8, -93]

PROBLEM: [[61, -157, 48], [29, 77, -102, -122, 50, 25, -186], [44, -84, -172, -97, -142], [-194, 62, -5, -145, 93]]

SOLUTION: [61, 77, 44, 93]

PROBLEM: [[-50, -56, -14], [-24, -17, 39, -108, -14, 48, -24], [71, -122, 50, -77], [-146, -12, 16, -6, 12], [-134, -117, 29, -101], [-117, 97, 76, 87, -41, 14], [63, -177, 58, 4, -92], [-194, -32, -19, -169], [-101, 82, 42, 10, -140, -141, -120]]

SOLUTION:
[-14, 48, 71, 16, 29, 97, 63, -19, 82]