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, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]

SOLUTION: [90, -12, 100, 6]

PROBLEM: [[-18, -153, 98, -195], [-154, -184, -85, -25, -121, -55], [-153, -57, -109, 42], [-101, -163], [76, 11, -100, -160, 62, -181, -1], [88, 92, 83, -44, -164], [-11, -91, 82, -166, -126, -22], [53, -186, -21, 25, -191, -100], [44, 30, -195, -56, 53, -183]]

SOLUTION: [98, -25, 42, -101, 76, 92, 82, 53, 53]

PROBLEM: [[-81, -154, 97, -196, -111, -54, -164], [-70, -63, -141, 47], [-133, -88, 84, -175, 67, -90, -137], [92, -88, -188, -108], [87, 76, -166, -64, -147, -165, -63], [-164, -96, -123, -146, -76], [-170, -166, 74], [-199, -122, 35, -129], [-127, -139, -100, 7]]

SOLUTION:
[97, 47, 84, 92, 87, -76, 74, 35, 7]