Olympiad Number Theory · Superchallenge problem

How many ways can $10$ identical balls be distributed into $3$ distinguishable boxes so that no box receives more than $5$ balls?