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: [[-23, 46, 40, -162, -97], [0, 78, -38, -80], [1, 79, 15, -7, -40, -88], [-117, -22], [96, -80, 62]]

SOLUTION: [46, 78, 79, -22, 96]

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: [[64, -36, -56, -15, 23], [-184, -96], [-128, -128], [-183, -21], [-128, -172, 42, 32, 40, -137, 32], [-133, -94, -188, -136], [-145, -32, -172, -125], [-91, 69], [-30, -117]]

SOLUTION:
[64, -96, -128, -21, 42, -94, -32, 69, -30]