Find out the number of solutions to the equation- $x_1 + x_2 + x_3 + x_4 + x_5 + x_6 = 25$ under certain constraints How many solutions are there to the equation $x_1 + x_2 + x_3 + x_4 + x_5 + x_6 = 25$ where each $x_i$ is a non-negative integer, $3 \leq x_1 \leq 10, \ 2 \leq x_2 \leq 7$ and $x_3 \geq 5$
I have been able to do all my counting problems but this one. I can not find an equation for max number per variety.
I know that I will subtract the min for each $x$ from the total, but I can not do $\begin{pmatrix} 15 \\ 6\end{pmatrix}$ cause that would not factor in the max per variety. 
What is the equation I would use for this?

The generating function would be 
$$(x^3+x^4+...+x^{10})(x^2+x^3+...+x^7)(x^5+x^6+...)(1+x+x^2+...)^3$$
Simplify,
$$x^{10}(1-x^8)(1-x^6)({1\over 1-x})^6$$
Now we are finding the coefficient of $x^{25}$ of the above, which is same as  $x^{15}$ in 
$$(1-x^8)(1-x^6)({1\over 1-x})^6=(1-x^8-x^6+x^{14})({1\over 1-x})^6$$
So the coefficient of $x^{15}$ is 
(coefficient of $x^{15}$ in $({1\over 1-x})^6$)$-$(coefficient of $x^{7}$ in $({1\over 1-x})^6$)$-$(coefficient of $x^{9}$ in $({1\over 1-x})^6$)$+$(coefficient of $x^{1}$ in $({1\over 1-x})^6$)
Which is basically
$${15+6-1\choose6-1}-{7+6-1\choose6-1}-{9+6-1\choose6-1}+{1+6-1\choose6-1}$$
