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: [[-169, -104, 48, -186, 57, -108], [-36, 65, -62, -91, 58, 55, -136], [-107, -18], [-52, -153, 45, -119, -105, 18], [65, 58, -15, -79, 82, -93], [-178, 96, -64], [44, -116, -197, -109, -15], [-161, 23, -115, -148, -175, -189, -175]]

SOLUTION: [57, 65, -18, 45, 82, 96, 44, 23]

PROBLEM: [[-72, -37, -51, 45], [-102, 17, -162, -122, -145], [-40, 31, -71, 89, 92, -3, 16], [-155, -190, 12, 3], [-2, -150, -94, 28, -52, 7], [-150, -106, 8], [-102, -174, -93, -186, -194]]

SOLUTION: [45, 17, 92, 12, 28, 8, -93]

PROBLEM: [[98, 32, 30, -10, 89, -8], [25, -187, -120, 100, -120, -70, -171], [-165, -108, -42], [-45, 96, -51, 98, -104]]

SOLUTION:
[98, 100, -42, 98]