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: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]

SOLUTION: [79, 0, -71, 32, 98, 26, 20, 70]

PROBLEM: [[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]

SOLUTION: [96, 48, 65, 19, -26, 95, -11]

PROBLEM: [[60, -150, -12], [-161, 87, 21], [-67, -174, -41, -200], [33, -29, -87, -178], [19, -2], [73, 18, -75, -133, 0]]

SOLUTION:
[60, 87, -41, 33, 19, 73]