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: [[-88, 39, 100, -118, -13], [-81, -150], [38, -64, -137, -74, -27, 84]]

SOLUTION: [100, -81, 84]

PROBLEM: [[-195, 0], [42, 19, -7], [-155, -76, -83], [-144, 19, 88], [-139, -174, -137, 59]]

SOLUTION: [0, 42, -76, 88, 59]

PROBLEM: [[-71, -149, 13], [-179, 33, -144, -69], [-27, 1, -27, -89, -182]]

SOLUTION:
[13, 33, 1]