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: [[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]

SOLUTION: [-3, 50, -38, 51, 42, 54, 81, 76]

PROBLEM: [[30, -72, 78, 12, -87, -118, 40], [-139, 17, 10, -139, -120, 53, -127], [-122, 28, -161, 93, 9, -171], [-195, 86, -34, 15, 73], [-71, -31, -147, -106]]

SOLUTION: [78, 53, 93, 86, -31]

PROBLEM: [[64, -179, -73, -85, -188, -193, 99], [-110, 11, -65], [-15, 24, 12], [59, -12, -186, -163, -108]]

SOLUTION:
[99, 11, 24, 59]

