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: [[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]

SOLUTION: [99, 54, 32]

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

SOLUTION: [58, 19, 68]

PROBLEM: [[-147, -139], [30, -72], [80, 31, 49, -103, -175, -114, 88], [31, 70, 48, -40, 34, 78], [-129, -107, 46, -54, -187], [-71, -44, 28, 74, -50, 13], [-6, 77]]

SOLUTION:
[-139, 30, 88, 78, 46, 74, 77]