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: [[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]

SOLUTION: [84, 1, 35, -78, 24, 87]

PROBLEM: [[-123, -166, -164, -185, -94, -149, -169], [-112, -104, -146, 88, -38, -158, -161], [-84, -9, -34, -8, 36], [-183, 70, 42, -11], [13, -86, -180, -93]]

SOLUTION:
[-94, 88, 36, 70, 13]