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: [[-101, -84, 47, -147], [-117, -82, -152, -159, 40]]

SOLUTION: [47, 40]

PROBLEM: [[-35, 83, -145, -47, -160, -105], [-174, -29, 64, -182, 87, 53, -148], [8, -178, 46, 54], [-46, -140, -18], [-42, 51, -72], [-61, -17, -13, -52, -161]]

SOLUTION: [83, 87, 54, -18, 51, -13]

PROBLEM: [[74, 95], [-157, -85, -180, 47, 45, -132, -47], [-177, 91, 52, 12, -125, 41, -138], [-151, 81, -103, -139]]

SOLUTION:
[95, 47, 91, 81]