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: [[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]

SOLUTION: [96, 48, 65, 19, -26, 95, -11]

PROBLEM: [[-30, 98], [-1, -54, -94], [71, -126, -77, -12, -162], [99, -22], [-96, 27, -117, -181, -152, -153, -182], [-25, 41, -181, 0, -66, 41], [-167, 38, -86]]

SOLUTION:
[98, -1, 71, 99, 27, 41, 38]