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: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]

SOLUTION: [17, 85, 20, 70, 12, 73, 90, 59, 58]

PROBLEM: [[-117, -191, 74, -91, 71], [-175, -177], [67, 65, -160], [-98, -28, -119, -66, 29, 7, -106], [-7, -132, -151], [-139, -163, -10, 40, 81]]

SOLUTION: [74, -175, 67, 29, -7, 81]

PROBLEM: [[-84, -74, -134, -104, -76], [-3, 80, -149, -103], [30, -148, -109, 11, -191], [-26, 8], [-20, 9, 96, 8], [-114, -88, 52, -80], [-124, -158]]

SOLUTION:
[-74, 80, 30, 8, 96, 52, -124]