Welcome to Bytelearn!

Let’s check out your problem:

José is on a gameshow that involves a taste test. He gets to see a list of $15$ different secret ingredients before tasting $3$ dishes one after the other. The $3$ dishes are all identical to each other except that each dish contains $1$ of the $15$ secret ingredients. He gets $60$ seconds to identify what secret ingredient was in each dish.$\newline$The permutation formula $n \mathrm{P} r$ can be used to find the number of unique ways to arrange the ingredients in the dishes.$\newline$What are the appropriate values of $n$ and $r$ ?$\newline$$$\begin{array}{l} n=\square \\ r=\square \end{array}$$