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: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]

SOLUTION: [-61, -68, -103, 97]

PROBLEM: [[-153, 77, 64, -116, -130], [-176, -137, -198], [22, -14, -129, 76, -76], [-15, -37, 92, -141, -51], [13, 89, -191, -24, -197], [-11, 30, -51, 61, 26, 7, -105], [-126, -126], [-178, -132, 98, -22, 77], [7, -190, 60, -51, 62]]

SOLUTION: [77, -137, 76, 92, 89, 61, -126, 98, 62]

PROBLEM: [[-169, -129, -193, 1, -118], [-107, 79, -110, -5, 62, -65]]

SOLUTION:
[1, 79]