Use a permutation when order matters and repetition is not allowed:

$$_nP_r = \frac{n!}{(n-r)!}$$

Return the number of ways to fill r distinct ordered roles from n people.

solve(12, 3)  ->  1320     # president, VP, secretary from 12 students