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: [[-92, 82], [-90, 37], [-135, -183], [-140, 37], [-156, -132, -162, -185], [28, 67, -110, -50, -53]]

SOLUTION: [82, 37, -135, 37, -132, 67]

PROBLEM: [[-124, 90], [33, -200, -184, -146, -70, -127], [-122, -168], [-90, -117, -88, 57], [20, -167, -118, 72, -162, -143], [-72, 36, -70, -64], [100, -10, -40, -52], [-40, -128]]

SOLUTION:
[90, 33, -122, 57, 72, 36, 100, -40]