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: [[-88, -73, 65, 51, -100], [-75, -195], [-115, 4, -152, -151, -65, 95, 85]]

SOLUTION: [65, -75, 95]

PROBLEM: [[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]

SOLUTION: [73, 26, 81, 48, 31, 25, 44, 31]

PROBLEM: [[74, -143, -151, -188, 19], [-188, 57, 26, -66, -177, 13], [-175, -40, -99, -50, -167], [-14, -119, 41, -174, 88, 10, -115], [-154, -22, -44, -61, 37], [-62, 89], [-109, -37, -129, 28, -34, -12]]

SOLUTION:
[74, 57, -40, 88, 37, 89, 28]