28, 10 identical oranges are placed into 3 different plates, allowing some plates to be empty. How many different ways are there to do this? $\qquad$
We know that the stars and bars method requires each group to have at least one element, but here, the number of elements can be 0, so it does not meet the requirement of the stars and bars method, and we need to transform it.
Let the number of oranges in the 3 different plates be $\mathrm{a}$, $\mathrm{b}$, and $\mathrm{c}$, respectively, then we have $a+b+c=10$ (here $\mathrm{a}$, $\mathrm{b}$, and $\mathrm{c}$ can be 0)
To meet the requirement of the stars and bars method, where each group has at least one element, we transform it to $(a+1)+(b+1)+(c+1)=13$
So this problem becomes: "13 indistinguishable oranges are placed into 3 different plates, with each plate having at least 1 orange. How many different ways are there to do this?"

Therefore, $C_{13-1}^{3-1}=C_{12}^{2}=66$ (ways)