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: [[-54, 43, 14, 3, -181, 28], [-137, -54, -62, -1], [40, -168, -120, -195, 17, -9, 6], [-100, 36, 80], [-9, 30, 73, 32]]

SOLUTION: [43, -1, 40, 80, 73]

PROBLEM: [[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]

SOLUTION: [57, 80, -20, -50, 8, 64]

PROBLEM: [[-98, -110, 7, -191], [-110, -23, -78, -49, 0, 100], [-17, -74, -99, -127, 51, -137], [-61, -80, -140, -65, -193, -180]]

SOLUTION:
[7, 100, 51, -61]