You have 20 runners in the marathon, to determine how many different ways could you group the runners so that they end up in the first three places r=3 you have to calculate the permutation without repetition. We use permutation because the order matters, since the prize changes as the runner comes in first, second or third place.
It is without repetition because a runner cannot finish between the first three places twice at the same time.
The formula you have to use is
n is the total number of runners
r is the number we have to choose
Correct option is B.