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: [[50, -128, 17, 76, -122, 50], [6, -23, -7, -120, 28, -26], [-16, -60, -152], [28, -111, 22, -26, -61, -141, -16], [-51, 74]]

SOLUTION: [76, 28, -16, 28, 74]

PROBLEM: [[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]

SOLUTION: [-19, -112, 30, 59, 65, -7, -16, 86, 39]

PROBLEM: [[-178, -122, -19, -142], [7, -65, 67, -189, -167, -67], [-197, 79], [-7, 30, -190], [-193, -2, -190, -100, -105], [6, -199], [19, 97, -22, -114, -44, -176]]

SOLUTION:
[-19, 67, 79, 30, -2, 6, 97]