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: [[83, -95, 37, -7], [33, -23, -133, -134, 77], [52, -161, 1, 34, -123, -29], [-130, 51, 97, -29], [-14, 36, -88, 49, -199]]

SOLUTION: [83, 77, 52, 97, 49]

PROBLEM: [[-40, -76, -96, -149, -157, -111, 20], [32, -8, -51, -134, -72, 99, -189], [3, -63, -177, -192], [-142, -34, -74, -58, 7, 16], [-109, 74, -95, 10]]

SOLUTION:
[20, 99, 3, 16, 74]