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: [[-83, 24, -69, 26, 65, 98, 83], [-6, -181, 72, -139, -1, -80, 64], [48, -15, -94, -160, -61, -158, 41]]

SOLUTION: [98, 72, 48]

PROBLEM: [[44, -68, -105, -118, -69, -34], [-165, -178, -23, -106, 98, -23], [35, 54, -197, 51, -9, 73], [100, 48, 94, -44, 49], [-153, -146, -127, 68, 77], [-175, -41], [-110, -10]]

SOLUTION:
[44, 98, 73, 100, 77, -41, -10]