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: [[-116, 8, -187, -74, -77], [-94, -11], [-145, -120, -47], [-178, -61, -91, -105, 24, 20], [61, -196, -157, -35, 35, -43, -195], [-193, -67], [-44, -22, -119, -11, -193], [70, -153, -120, 14, -140], [10, -170, -131, 6, -151]]

SOLUTION: [8, -11, -47, 24, 61, -67, -11, 70, 10]

PROBLEM: [[18, 55, -103], [-91, 6, -103, 0, -140, -53, 94], [89, -82], [-134, 30, -157, -82, -41], [-52, 77, -163], [-122, -133, -98, 48, 87, -106, 37]]

SOLUTION: [55, 94, 89, 30, 77, 87]

PROBLEM: [[-81, -174, -79], [6, -131, -75, 40]]

SOLUTION:
[-79, 40]