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: [[-150, 80, -128, -124], [-179, 83, -152, 11, -187, -1, -81], [88, -154, -20], [-59, -40, -39, -188], [-8, -53, 29, -181, 77], [-69, -7, 60, 22, -121], [-51, -96, -16, -120], [-79, 93, -86, -16, -96, -74, -187], [-39, -195, 86, 32]]

SOLUTION: [80, 83, 88, -39, 77, 60, -16, 93, 86]

PROBLEM: [[-168, -52], [-183, 2, -104, 24, -153, -56], [25, 78, -118, -28, -39, -12], [97, 95, 12, -21, 82]]

SOLUTION: [-52, 24, 78, 97]

PROBLEM: [[-149, -181, -196, -193], [-57, -27, 39, -87, 45, -93], [85, -141, -15, -134], [-103, -197], [-66, 1, -183, -60, 9, -200], [-122, -181, 81, -183], [-100, -192, -8, 35, -30, -194, -117]]

SOLUTION:
[-149, 45, 85, -103, 9, 81, 35]