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: [[-82, -50, 44, -81, 8, -40, -47], [57, -72, 38, 1, -158], [-7, -143, -15, 55, 2], [67, 50, 78, 15, 77], [5, -174, -101, -40, 8], [-38, -10], [-45, -138, -140, 13, -76, -37]]

SOLUTION: [44, 57, 55, 78, 8, -10, 13]

PROBLEM: [[14, -199], [-96, -75, -1, -54, -147, 98, 70], [2, 49, -99, -98, 48], [45, -143, -123, 36, 77, -115, -27], [-102, -120, -166], [69, -52, -1, -104], [-72, -135], [-77, 69, -114], [-47, -151, -82, -73, 92, -19]]

SOLUTION: [14, 98, 49, 77, -102, 69, -72, 69, 92]

PROBLEM: [[-188, -84, -155], [-149, -97, -110, 75, -160, -82, -136], [-143, 15, -17, -131, 59, -200], [-136, -96, 35, -63, 4], [-163, -100, -32], [-99, -37, -125, -26, -196, -187, 42], [-164, -51, 65]]

SOLUTION:
[-84, 75, 59, 35, -32, 42, 65]