We have been given in a cohort of 35 graduating students, there are three different prizes to be awarded. We are asked that in how many different ways could the prizes be awarded, if no student can receive more than one prize.
To solve this problem we will use permutations.

We know that formula for permutations is given as

On substituting the given values in the formula we get,


Therefore, there are 39270 ways in which prizes can be awarded.