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: [[72, -19, -46, -126], [0, 47, 52, -113, -37, -16, -81], [82, -7, 2, 84, 38], [-178, -84, 84, 14, -123]]

SOLUTION: [72, 52, 84, 84]

PROBLEM: [[89, -153, 6, 22], [-170, -13, -120, -83], [20, -54, -193, -101], [7, 92], [-25, 100, -154, -30, -135], [13, -180, -117, -107], [6, -165, -63, -95, -197, -190, -113], [-92, -160, 88, 9, -185, -178, -36], [-154, -176, -126, -4, 71]]

SOLUTION: [89, -13, 20, 92, 100, 13, 6, 88, 71]

PROBLEM: [[-103, -82], [59, 62, -199, -174, -108, 57], [-106, 45], [-148, -16, -121, -107]]

SOLUTION:
[-82, 62, 45, -16]