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: [[-2, -170, -178, -115], [52, 57, -200, -86, 14, 31, -19], [-121, 20, -2, -173, -85, -115, 97], [30, -119, -33], [-40, -53, 24, -133, -196]]

SOLUTION: [-2, 57, 97, 30, 24]

PROBLEM: [[92, -175], [-99, -116]]

SOLUTION: [92, -99]

PROBLEM: [[51, -77, 69, -165, -145, -39, -99], [-93, 35, -140, -131, 9], [49, -139, -173, -16], [-81, -186, 83, -190], [-26, -151, -161, -28, 7, -194], [-175, -31, 63, -98, -23], [-98, -176, 32], [-110, 12, -115], [-168, 15, -25, 49, -124, -11]]

SOLUTION:
[69, 35, 49, 83, 7, 63, 32, 12, 49]