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: [[-78, 45], [-124, 37, 96, 43], [-24, -6, -137], [-99, -191, -101, -52], [-9, -100, -193, 24, -31, -112]]

SOLUTION: [45, 96, -6, -52, 24]

PROBLEM: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]

SOLUTION: [100, 84, -63, -55, 78, 58, 86, 99]

PROBLEM: [[-146, -125, -47, 21, -172, -199], [-1, -80, -101, 15], [-49, 20, 3], [-169, 74, 13], [16, 11, -162, 51, -198, -28]]

SOLUTION:
[21, 15, 20, 74, 51]