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: [[-120, 64, 10, -43], [-7, -30, -37, -45, 4, -185], [-17, 44, -62, -97, -5, 10, -20], [7, 91, -56, 24], [-138, -169, -139, -172, 57, -53], [62, 31, 12, 20, -182, -188, -198], [-45, -3, -11, -187], [-10, -200, -76, -160, -151]]

SOLUTION: [64, 4, 44, 91, 57, 62, -3, -10]

PROBLEM: [[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]

SOLUTION: [63, 2, 29, 18, 98]

PROBLEM: [[57, -36], [-54, -98, 97, 16], [36, 67, 29, -70, -105], [93, -114, -12, 46, 64, -125, -186], [-200, -97, 50, 68, 73]]

SOLUTION:
[57, 97, 67, 93, 73]