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: [[-35, -168], [73, -23, -44, -109], [-90, 58, -47, 56], [-27, -102, -149, -183, 72]]

SOLUTION: [-35, 73, 58, 72]

PROBLEM: [[3, -173, -3, -59, -120, -192, -58], [-63, 90, -136], [35, 84, 66, 82], [48, -20, -198], [71, -178, -131], [72, -85, -121, -102, 40, -133], [34, 49, -81, 8, -174, -103], [-111, 74, 98, -150, 76, -75], [75, -18]]

SOLUTION:
[3, 90, 84, 48, 71, 72, 49, 98, 75]