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: [[-20, -187], [-50, -191], [-69, -155, -10, -152, -72, 86], [53, -172, -84, 95]]

SOLUTION: [-20, -50, 86, 95]

PROBLEM: [[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]

SOLUTION: [-17, -31, 56, 64]

PROBLEM: [[-69, -17, 45, -85, -171, -191], [-15, -94, 66, -62, -85, -110], [20, 43, -45, 1, 73, -146, -6]]

SOLUTION:
[45, 66, 73]