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: [[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]

SOLUTION: [-16, 68, 80, -85, -15, 94, 69]

PROBLEM: [[-16, -122, -165, -24, -65], [54, -101, -193, -96, -38, 62], [39, 97, -8], [-107, 17, -54], [-151, -180, 85], [-115, -190, -121, -172, 96, -79, -149], [33, 3, 99, -105, -146, 59], [-131, -186, -36, -199, -102, 41, -36]]

SOLUTION:
[-16, 62, 97, 17, 85, 96, 99, 41]