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: [[-15, -180, -24], [-18, -77], [-167, -37, -37], [97, 80], [-91, 18, -122, -8, 90, -125, -162], [96, 74, -57, 89, -171], [66, -113]]

SOLUTION: [-15, -18, -37, 97, 90, 96, 66]

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: [[96, 50, -146, -155], [-70, 10, -133, 49, 54, -69], [-155, -104], [81, 82, -167, -114, -101, 96, -148], [21, -84, -72, 74, -21, -59], [94, -109, -150, 70]]

SOLUTION:
[96, 54, -104, 96, 74, 94]