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, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]

SOLUTION: [38, 25, -7, 1, 40, 92, 87, 76, -95]

PROBLEM: [[98, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]

SOLUTION: [98, 56, 93, 13, 28, 59, 74]

PROBLEM: [[79, 57, 26, -33, -107], [35, -177, 61, -97, 55, -131], [-174, -115, 12, -153], [-16, -134, -57, -67, -15, -151, -195]]

SOLUTION:
[79, 61, 12, -15]