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: [[-1, 80, -4, 63], [-191, -139, 22, 31, -145], [-154, -165, 43, -190]]

SOLUTION: [80, 31, 43]

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: [[2, 36, -16, 9, -8], [24, -119, 69, 8, -145], [-156, 60, -164, 32], [88, 2, 70, 29, -177, -32, -185]]

SOLUTION:
[36, 69, 60, 88]