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: [[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]

SOLUTION: [25, 32, 86, 96, -33, 84, 93]

PROBLEM: [[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]

SOLUTION: [100, -120, -94, 63, 50, -139, 80, 56, 88]

PROBLEM: [[-108, -119, 71, -83, -124], [-101, -116, -190, -182, -12], [31, -86, -3, 68, 73, -119], [-62, -26, -41, -128, -12, 93, 35], [-174, -70, -23, 39, -169, -133, 50]]

SOLUTION:
[71, -12, 73, 93, 50]