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: [[-120, -84], [10, 74, -15, -153]]

SOLUTION: [-84, 74]

PROBLEM: [[-116, 74, -148, -128, 83, -15, 92], [29, -115], [-186, -195, -2, -125, -22, -120]]

SOLUTION: [92, 29, -2]

PROBLEM: [[-59, -70, -167], [-159, 54], [95, -15, 33, 16, 60, -39, 69], [70, -160], [13, -154, -44, 65, -53], [-8, -98, 32, 77, -190]]

SOLUTION:
[-59, 54, 95, 70, 65, 77]