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: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]

SOLUTION: [67, 90]

PROBLEM: [[-54, -80, 72, -155], [-182, 65]]

SOLUTION: [72, 65]

PROBLEM: [[2, 46, -51], [-38, -199, 71, -155, -29, -53, -101], [25, 24, 24, -86, -85, 32, 6], [75, 50, -110], [47, -25, -41, 50]]

SOLUTION:
[46, 71, 32, 75, 50]