Answer:
1320 ways
Explanation:
Here we have a situation where 3 ribbons will be awarded to 3 of the 12 contestants. We can use the permutation formula, because the order of awarding the ribbons matters.
The permutation formula is:

n = 12
k = 3
Now that we have our variables, let's plug them into the formula.



So there are 1320 different ways that the contestants will be awarded.