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: [[-124, -174, -30, -67], [44, -156, -76, 68, -145, -19, -178], [-18, -104, -19, -63, -15], [-99, 12, -129, 38, 4]]

SOLUTION: [-30, 68, -15, 38]

PROBLEM: [[-30, 3, -3], [25, 19, -59], [-107, 15, 68, -96, -43], [-197, 60, 57, 29, -134], [83, -125], [85, -80, -45, 3, 61, 5], [-116, -197, 20, -12, -29, 22, -81], [-191, 84, 71, 53]]

SOLUTION:
[3, 25, 68, 60, 83, 85, 22, 84]