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: [[-149, 97, 37, -156], [-179, -55, -35, -109], [-64, -190, 7, -6, -4, -96, -149]]

SOLUTION: [97, -35, 7]

PROBLEM: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]

SOLUTION: [58, 19, 68]

PROBLEM: [[-72, 46, -85], [95, 66, -165, 93, -161, 41]]

SOLUTION:
[46, 95]