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: [[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]

SOLUTION: [-33, 49, 37, -34, 92, 57, 19, 72, -92]

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: [[-106, 57, -83, 74], [-19, 92, -1, -88, -52, -85, 89], [-73, -33, 9, -54, -31, 8, -56], [-193, -44, -151], [93, 3], [-192, 48, -4]]

SOLUTION:
[74, 92, 9, -44, 93, 48]