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: [[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]

SOLUTION: [51, 49, 86, 66, 74, -151, 49, 25]

PROBLEM: [[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]

SOLUTION: [91, 100, 86, 84, 13, 53, -32, 54]

PROBLEM: [[-33, 36, -190, -146], [-82, -180, -88, 18, 87], [-91, 91, -56, 24, -97], [-42, -125, 10, -32, -51, -195, -140], [70, -69, 29, -192], [-140, 83], [18, -112, 30], [80, -100, 84, 95, -173, -198]]

SOLUTION:
[36, 87, 91, 10, 70, 83, 30, 95]