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: [[25, 22, 14, -95], [-48, -20, -187, 29, -172, -188, 54], [-66, -45], [64, 76, -182, 0, 79, 30], [21, -174, 96, -43, 23]]

SOLUTION: [25, 54, -45, 79, 96]

PROBLEM: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

SOLUTION: [2, 72, 60]

PROBLEM: [[-109, -74, -109, -191], [42, -16, -67, -61, -95, 1], [-91, -37], [5, -20, 18, -178, -39, -147], [-69, 69, 42]]

SOLUTION:
[-74, 42, -37, 18, 69]