The problem of counting the solutions $(a_1,a_2,\ldots,a_n)$ with integer $a_i\geq0$ for $i\in\{1,2,\ldots,n\}$ such that $$a_1+a_2+a_3+\ldots+a_n=N$$ can be solved with a stars-and-bars argument. What
What is the solution if one adds the constraint that $a_i\leq r_i$$a_i\leq r_{i}$ for certain integers $r_1,\ldots,r_n$$r_{1},\ldots,r_n$?
e.g. for $n=3$, $N=6$ and $(r_1,r_2,r_3)=(3,3,2)$, the tuple $(a_1,a_2,a_3)=(2,3,1)$ is a solution, but $(2,1,3)$ is not a solution because $a_3=3>2=r_3$$a_{3}=3>2=r_3$.