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: [[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]

SOLUTION: [61, 73, 78, 71, -99, 88, -30]

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: [[-60, 85, 9, -81, -12, -145, -183], [48, 58], [-151, -28, 40, 79], [-129, -116, 40], [-149, 81]]

SOLUTION:
[85, 58, 79, 40, 81]