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: [[47, -65, -11, 25, -17], [-93, -195, -89, 27, -81, -190], [-59, -20, -10, 93, -93], [-130, -31, 67, -36, -18, -125], [54, 100, -27, -38, -154, -96], [-148, 23, 70, -162, -145], [-83, -95, -44, 11, -155], [-43, -195, -94, -5], [-17, -99, -23, -176]]

SOLUTION: [47, 27, 93, 67, 100, 70, 11, -5, -17]

PROBLEM: [[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]

SOLUTION: [86, 23, 78, 68, -116, 72, 55, 53]

PROBLEM: [[43, 48, -191, -5, 86, -150, -162], [21, -160, -115, -39, 71], [-8, -19, -56, 91], [-48, -96, -138, -92, -78, 41], [-58, -96, 90], [2, -133, -115, -17, 70], [-70, -48, -105, -189, 96], [6, -180, -62]]

SOLUTION:
[86, 71, 91, 41, 90, 70, 96, 6]