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: [[95, -34, -73, 46, 51, -185, -192], [-43, -56, -90, -52], [59, 91], [90, 18, 33, -33, -62, -52]]

SOLUTION: [95, -43, 91, 90]

PROBLEM: [[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]

SOLUTION: [-63, 82, 79]

PROBLEM: [[-1, -107, -90, -141], [-196, 90, -101], [41, 52, -106, -140, -179], [41, -86, -5, -177, 28, 93, 90], [97, 63, 9, -182, 57, 99, 83], [-184, -181, -112, -81]]

SOLUTION:
[-1, 90, 52, 93, 99, -81]