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: [[9, 77, 13, -72], [-100, 81, -199, -3, -197, -12], [85, 59, -67, -35], [25, 93], [-80, 54], [29, 50, -184, 88, -106]]

SOLUTION: [77, 81, 85, 93, 54, 88]

PROBLEM: [[-111, -54, -11, -97, -137, 82], [63, -197, 31]]

SOLUTION: [82, 63]

PROBLEM: [[-92, 80, 48, 34, -176, -99, 15], [38, -181, 6, -160, -161], [-169, -185, -197, -188, -23], [30, -173, -145], [49, -97, -33, -118], [-89, 4, 63], [49, 65], [-72, -135, -167, -117, 71, -17, -150]]

SOLUTION:
[80, 38, -23, 30, 49, 63, 65, 71]