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: [[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: [[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]

SOLUTION: [38, 80, 94, 31]

PROBLEM: [[-49, 17, -169, -187, -195, 57, 84], [0, 100, -133, 45, -32, 9], [-172, -182, -97, 77, -129, -184], [19, -170]]

SOLUTION:
[84, 100, 77, 19]