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: [[78, -179], [-154, 26, -194, -39], [73, -154, 7, -158, 45]]

SOLUTION: [78, 26, 73]

PROBLEM: [[-169, 82, -165], [-79, -25], [-81, 83, -10, -121, -43], [-118, -97, 32, -6, 37, 21], [-59, -11, -35]]

SOLUTION:
[82, -25, 83, 37, -11]