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: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]

SOLUTION: [95, 60, 31, -122, 66, 84, 17]

PROBLEM: [[-54, 44, 83, -159], [-121, -81], [-49, -186], [61, -20], [97, -128], [0, -50, 29, -154, -159, 40, -68], [-30, 77, -132, -155, -1, -90]]

SOLUTION: [83, -81, -49, 61, 97, 40, 77]

PROBLEM: [[96, -120], [-120, -151, 0, -152, -49]]

SOLUTION:
[96, 0]