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: [[-160, -157, 75, 3, -119, 14, -70], [-156, 70, 10, 21], [-86, 47], [-52, 80, 87, 26, -100, 48], [-36, -127, 37, -1, -59, -26, 8], [72, 48], [-200, -178, -142, -12], [-5, -61], [76, -54, -134]]

SOLUTION: [75, 70, 47, 87, 37, 72, -12, -5, 76]

PROBLEM: [[-38, -147, 7, 87, 35, -6, -90], [-83, 85, -60, -52, 8, -114, -191]]

SOLUTION: [87, 85]

PROBLEM: [[8, -61, -128, -171, -66, 69], [-94, -106, 88, 92, 28], [-107, -119], [23, -153, -125, -198, -71], [-181, -25, -60, 83, -104, -162, 83], [75, -180], [50, -19, -120, 37, -167, -33, -90], [-165, -44], [-122, -171, -40, -125, 92, 3]]

SOLUTION:
[69, 92, -107, 23, 83, 75, 50, -44, 92]