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, 25, -177, 29, 1], [85, 82, -6, -151, -93, -182], [-181, 99, 32, 16, -116, 89], [-29, -186, -40, -7, -64, -29, -33], [-27, -68, -126], [-77, -3, -144]]

SOLUTION: [29, 85, 99, -7, -27, -3]

PROBLEM: [[-154, 100, 9, -11, -21, 53, 23], [-53, 63, -128, 52, -16, -56], [-172, -89]]

SOLUTION:
[100, 63, -89]