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: [[-81, 65, -143, -49, -125, 36, -53], [-37, -168, 75], [-192, 56, 4, 48, 69, -141, -79], [-75, -151, -50, 0, -158, -195, 44], [-159, -180, -122, -57, 52, 18, -94], [-32, 2, -54, -25, 16, -52]]

SOLUTION: [65, 75, 69, 44, 52, 16]

PROBLEM: [[18, -24, 22, -153, 38], [34, 6, -5, 98, -168], [-137, -175, -142, 39, 10, -54, -95], [-127, -48, -200, 24], [-166, -170, -38, -121], [-60, 1]]

SOLUTION: [38, 98, 39, 24, -38, 1]

PROBLEM: [[43, -103, -92, -19, -100, 68, -66], [-146, -167, 87, 71, 77]]

SOLUTION:
[68, 87]