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: [[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]

SOLUTION: [53, 64, -34, 92, 22, 82, 85, 81, 43]

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: [[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]

SOLUTION:
[90, -12, 100, 6]