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: [[-95, 64, 33, -57, -71], [55, -167], [92, -43, -108, -43, -100, -134], [95, -6, 0, 17, -162, -188], [9, 59, 56, 72, -140], [-155, -158, -66, -29], [63, -183]]

SOLUTION: [64, 55, 92, 95, 72, -29, 63]

PROBLEM: [[-56, -17, -187], [-135, -22, 5], [41, -132, -73, -106, -40], [4, -165, -9, -32, -167, -112], [-73, -120, -55, -46, -49, -71], [80, -199, -188, 25, -12, 7], [-22, -124, -193, 28, 92, 27], [-183, -80, 7, -156, 65], [61, -127, -144, -99, -195, 69]]

SOLUTION: [-17, 5, 41, 4, -46, 80, 92, 65, 69]

PROBLEM: [[-13, 91, 20, 3, -173], [-7, -192, 31, 29], [-81, 66, 77], [5, -131, -179, -198, 82, -177, -3], [-187, -20, -118, -134, -151, 90, -17], [-59, -51, -106, -139, -96, 79], [-120, -94, 23, -76, 81, 79], [28, 5], [-59, -44, -89, 71, -72, -95, -83]]

SOLUTION:
[91, 31, 77, 82, 90, 79, 81, 28, 71]