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: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]

SOLUTION: [79, -33, 2, 42, 81, -142, 71]

PROBLEM: [[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]

SOLUTION: [55, 21, 75, 84]

PROBLEM: [[-41, -198, -103, 12, -98], [-36, -28, 19, 36], [-81, -16, -173, -180, -154, -77], [-66, 45, -87, -96, -11, -70], [-158, 94], [77, 29, -33, -65, -73], [-15, -8, -68, 33, -143, -36], [-78, 29, 67, 66]]

SOLUTION:

Show your work and conclude with the exact phrasing "Therefore, the final answer is [answer]." where [answer] is just the final number or expression that solves the problem.
user
[12, 36, -16, 45, 94, 77, 33, 67]

