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: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]

SOLUTION: [75, 57, 75, 20, -95, 20]

PROBLEM: [[37, -149, 70, -32, -45, -159], [-144, -48], [-19, -130, -128, -154, -55, -183, -44]]

SOLUTION: [70, -48, -19]

PROBLEM: [[-93, -65], [38, -175, -150, -29, -62], [-17, -60, -118, -101, -132], [86, 64, -173, -128, -38, -118, -77], [99, -70]]

SOLUTION:
[-65, 38, -17, 86, 99]