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: [[-141, -120], [12, -89], [-27, -150]]

SOLUTION: [-120, 12, -27]

PROBLEM: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]

SOLUTION: [-76, -61, 22, 62]

PROBLEM: [[-27, -100], [-15, 56]]

SOLUTION:
[-27, 56]