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: [[-8, 97, -87, -60, -88], [0, -125, 0, 24, -155, -98], [-43, -150], [-196, 79], [-38, 51], [-88, -74, 28, -106, 45, 72]]

SOLUTION: [97, 24, -43, 79, 51, 72]

PROBLEM: [[-20, -187], [-50, -191], [-69, -155, -10, -152, -72, 86], [53, -172, -84, 95]]

SOLUTION: [-20, -50, 86, 95]

PROBLEM: [[31, 28, -181], [72, 72, 3, -123, -52], [-19, -156], [-161, -81, 53, 58, 6, -189], [-9, -171, 99, 45], [-3, -42], [-106, -49, -177, -21, -37, -26], [97, 3, -130, -30, 15]]

SOLUTION:
[31, 72, -19, 58, 99, -3, -21, 97]