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: [[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]

SOLUTION: [-47, 0, -11, 6, 85, 50]

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: [[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]

SOLUTION:
[90, -4, 18]