Since the the people are not auditioning for the same position, the order in which they are selected matters. This tells us that we have to calculate the permutation of 8 objects taking 3 at a time. The permutation of n objects taking r at a time is given by the formula

The director can fill these positions in 366 ways.
A quicker way to solve this problem would have been to realize that there are 8 ways to fill the first position. Once the first position has been filled, there are 7 ways to fill the second position. Once the second position has been filled, there 6 ways to fill the third position. The total number of ways to fill the positions will then be
. Both ways of working this problem out are valid.