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: [[37, -149, 70, -32, -45, -159], [-144, -48], [-19, -130, -128, -154, -55, -183, -44]]

SOLUTION: [70, -48, -19]

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: [[46, 40, -149], [-110, 95, -126, -20, -79], [9, -78, 39], [17, -5, 73], [80, 18, -188]]

SOLUTION:
[46, 95, 39, 73, 80]

