In how many ways can 10 blankets be given to 3 beggars such that each recieves at least one blanket? The question was to find the number of ways in which 10 identical blankets can be given to 3 beggars such that each receives at least 1 blanket. So I thought about trying the multinomial theorem...this is the first time I've tried it so I'm stuck at a point...
So $$x_1+x_2+x_3 = 10$$
Subject to the condition that :
$$1\leq x_1 \leq8$$
$$1\leq x_2 \leq8$$
$$1\leq x_3 \leq8$$
As each beggar can get at maximum 8 blankets and at minimum, 1.
So the number of ways must correspond to the coefficient of $x^{10}$ in: 
$$(x^1+x^2+x^3+x^4+x^5+x^6+x^7+x^8)(x^1+x^2+x^3+x^4+x^5+x^6+x^7+x^8)(x^1+x^2+x^3+x^4+x^5+x^6+x^7+x^8)$$
= coeff of $x^{10}$ in $x^3(1+x^1+x^2+x^3+x^4+x^5+x^6+x^7)(1+x^1+x^2+x^3+x^4+x^5+x^6+x^7)(1+x^1+x^2+x^3+x^4+x^5+x^6+x^7)$
= coeff of $x^{10}$ in $x^3(1+x^1+x^2+x^3+x^4+x^5+x^6+x^7)^3$
= coeff of $x^{10}$ in $x^3(1-x^7)^3(1-x)^{-3}$
= coeff of $x^{10}$ in $x^3(1-x^{21}-3x^7(1-x^7))(1-x)^{-3}$
= coeff of $x^{10}$ in $(x^3-3x^{10})(1+\binom{3}{1}x + \binom{4}{2}x^2+...+ \binom{12}{10}x^{10})$
= $\binom{9}{7} - 3 = 33$
Is this right? From here I get the answer as $\binom{9}{7} - 3 = 33$ but the answer is stated as $36$. I don't understand where I'm making a mistake

Try stars and bars. You have $10$ stars for the $10$ blankets:
$**********$
Now you can use $2$ bars to split this into $3$ sections. For example
$**|*******|*$
would mean beggar $1$ gets $2$ blankets, beggar $2$ gets $7$ blankets, and beggar $3$ gets $1$ blanket
Since each beggar should get at least $1$ blanket, we can't put the bars on the outside of the stars, and you also can't have the two bars between the same two stars. In other words, you need to choose $2$ out of the $9$ in-between locations, giving $9 \choose 2$ possible ways to do this.
