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: [[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]

SOLUTION: [38, 80, 94, 31]

PROBLEM: [[-88, 24], [-125, -39], [95, -76, -84, -69, -190, -148], [-196, 71, -2, -91, -112]]

SOLUTION: [24, -39, 95, 71]

PROBLEM: [[-172, -96, -99, 13], [17, -60, -94, 28, 20, 85], [56, -179], [-152, -20, -145, -126]]

SOLUTION:
[13, 85, 56, -20]