<s>[INST] Combinations of cards out of a deck with sets 
I have a deck of $25$ cards, $10$ of them are identical to each other, and the other $15$ are made of $5$ sets of $3$ identical cards for visualisation:
$10$ black, $3$ green, $3$ red, $3$ yellow, $3$ blue, $3$ pink
If I draw $10$ cards randomly, how many different hands can I draw?

I tried using my combinatorics knowledge but it wasn't enough, the answer itself is less important to me but the actual way is what I'm after here.
 [/INST] Let $x_b$ be the number of black cards, $x_{\color{blue}{b}}$ be the number of blue cards, $x_g$ be the number of green cards, $x_r$ the number of red cards, $x_p$ be the number of pink cards, and $x_y$ be the number of yellow cards.  Then the number of hands with ten cards is the number of solutions of the equation 
$$x_b + x_{\color{blue}{b}} + x_g + x_p + x_r + x_y = 10 \tag{1}$$
in the nonnegative integers subject to the restrictions that 
\begin{align*}
x_b & \leq 10\\
x_{\color{blue}{b}}, x_g, x_p, x_r, x_y & \leq 3
\end{align*}
Since we only have ten cards in our hand, the condition $x_b \leq 10$ cannot be violated.  However, up to two of the remaining five conditions can be violated.  It is not possible to violate three of them since $3 \cdot 4 = 12 > 10$.
If there were no restrictions, a particular solution of equation 1 would correspond to the placement of five addition signs in a row of ten ones.  For instance,
$$1 1 1 1 + 1 1 + 1 + + 1 1 1 +$$
corresponds to the solution $x_b = 4$, $x_{\color{blue}{b}} = 2$, $x_g = 1$, $x_p = 0$, $x_r = 3$, and $x_y = 0$.  The number of such solutions is the number of ways we can insert five addition signs in a row of ten ones, which is 
$$\binom{10 + 5}{5} = \binom{15}{5}$$
since we must choose which five of the fifteen positions (for ten ones and five addition signs) will be filled with addition signs.
From these, we must exclude those cases in which one or more of the restrictions are violated.  
Suppose $x_{\color{blue}{b}} > 3$.  Then $x_{\color{blue}{b}} \geq 4$.  Let $y_{\color{\blue}{b}} = x_b - 4$.  Then $y_{\color{blue}{b}}$ is a nonnegative integer.  Substituting $y_{\color{blue}{b}} + 4$ for $x_b$ in equation $1$ yields
\begin{align*}
x_b + y_{\color{blue}{b}} + 4 + x_g + x_r + x_p + x_y & = 10\\
x_b + y_{\color{blue}{b}} + x_g + x_r + x_p + x_y & = 6 \tag{2}
\end{align*}
Equation 2 is an equation in the nonnegative integers with 
$$\binom{6 + 5}{5} = \binom{11}{5}$$
solutions.  By symmetry, there are equal number of solutions in which one of the other four restrictions is violated.  Hence, there are 
$$\binom{5}{1}\binom{11}{5}$$
cases in which one of the restrictions is violated.
However, if we subtract $\binom{5}{1}\binom{11}{5}$ from $\binom{15}{5}$, we will have counted those cases in which two of the conditions are violated twice, once for each way we counted one of the colors as violating the restriction.  Since we only want to subtract them once, we must these cases back.
Suppose $x_{\color{blue}{b}} > 3$ and $x_g > 3$.  Let $y_{\color{blue}{b}} = x_{\color{blue}{b}} - 4$ and $y_g = x_g - 4$. Then $y_{\color{blue}{b}}$ and $y_g$ are nonnegative integers.  Substituting $y_{\color{blue}{b}} + 4$ for $x_{\color{blue}{b}}$ and $y_g + 4$ for $x_g$ in equation 1 yields 
\begin{align*}
x_b + y_{\color{blue}{b}} + 4 + y_g + 4 + x_p + x_r + x_y = 10\\ 
x_b + y_{\color{blue}{b}} + y_g + x_p + x_r + x_y & = 2 \tag{3}
\end{align*}
Equation 3 is an equation in the nonnegative integers with 
$$\binom{2 + 5}{5} = \binom{7}{5}$$
solutions.  By symmetry, each of the $\binom{5}{2}$ cases in which two of the five restrictions are violated results in an equal number of cases.  Hence, there are 
$$\binom{5}{2}\binom{7}{5}$$
cases in which two of the restrictions are violated.
By the Inclusion-Exclusion Principle, the number of ten card hands that can be formed is 
$$\binom{15}{5} - \binom{5}{1}\binom{11}{5} + \binom{5}{2}\binom{7}{5}$$
</s>