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: [[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]

SOLUTION: [74, 78, -132, 63, 73, 39]

PROBLEM: [[-68, -107, -111, -52, -133, 80], [-150, 54, 88, -69, 6], [84, -113, 35, -189, -49, -77, 19], [99, -97, -161, 61, -66, -73, 18], [34, -141]]

SOLUTION: [80, 88, 84, 99, 34]

PROBLEM: [[74, -57], [-33, 11], [-14, 18, -151, -89, -69, -106], [-199, -94, -143, -20, 56, -191, 19]]

SOLUTION:
[74, 11, 18, 56]