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: [[-22, -114, -146, 89, -169, -115], [85, -195, -162, -141, -15], [-144, -181, -104, 12, -10, 85, 37], [1, -65, -144, -42, -187]]

SOLUTION: [89, 85, 85, 1]

PROBLEM: [[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]

SOLUTION: [97, 23]

PROBLEM: [[74, 95, -133, -186], [-66, -178], [-7, -85], [-72, -35, 84, -106], [-39, -76, 26, -118, -23, -152, -155]]

SOLUTION:
[95, -66, -7, 84, 26]