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: [[96, -52, 68, -142], [-73, -61, -136, -199, 2], [-76, -160, -80, -125, -52, 19], [59, -116, -112, -40, -22], [-16, 43], [-187, 28, -125, -154, -93, -133, 38], [-46, -200, -124, -158]]

SOLUTION: [96, 2, 19, 59, 43, 38, -46]

PROBLEM: [[-54, -80, 72, -155], [-182, 65]]

SOLUTION: [72, 65]

PROBLEM: [[-185, -51, -121, -184, -1, -96, -147], [-182, 39, 2, -186, -171, -44], [-90, 56, 87, 13, -58, -93], [-57, -90, -121, -73, -160, 70], [-113, -89, -20], [-194, -45, -56, -153]]

SOLUTION:
[-1, 39, 87, 70, -20, -45]