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: [[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]

SOLUTION: [-7, 71, 29, 59, 93, 71]

PROBLEM: [[69, -92, -181, 13, 31, -185], [-14, -145, -116, 13, -132, 90, 0], [-188, -25, -182, -101, 14]]

SOLUTION: [69, 90, 14]

PROBLEM: [[-190, -28, 40], [-73, -182, -92, -81], [89, 1, -123, 80, 37, -179], [35, -179], [-46, 93, -9, -57, 22, 43], [-98, -143, 35], [23, -107, 23, -14, -76, -155], [15, -192, 5, 27]]

SOLUTION:
[40, -73, 89, 35, 93, 35, 23, 27]