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: [[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]

SOLUTION: [67, 26, 7, -16, 78, 79, 4, 85, 35]

PROBLEM: [[14, -64, 78], [-36, -133], [-17, 49, -19, -14], [-140, -55, 35]]

SOLUTION: [78, -36, 49, 35]

PROBLEM: [[34, 13, -17], [-7, -151, -40, 78], [-199, 16, 80, -63, -167], [-23, 89, -19, 13, -156], [-42, -42], [-8, -25, 95, -62, 66, 100, 8], [-106, 21, -102], [-121, -75, -144, -162]]

SOLUTION:
[34, 78, 80, 89, -42, 100, 21, -75]

