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: [[77, -10], [-44, 22, -89], [83, -197, -135], [94, 7, -166, -111]]

SOLUTION: [77, 22, 83, 94]

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: [[-60, -34, -193, -86, -197, -143, 96], [21, -40, 67], [77, -33, 12], [-35, -16, -64, 66], [-195, -145, -185], [-145, -66, -192, -102, -99, 28, -47], [-37, 95, -110, -47, -54, 97, 60]]

SOLUTION:
[96, 67, 77, 66, -145, 28, 97]