Adding onto Karl's answer, we want to find the number of nonnegative integer solutions to
$$x_1+x_2+x_3+x_4+x_5\leq 12$$
To determine this, we will first add a temporary variable, $c$, that is a nonnegative integer. We can use this variable to now have the statement
$$x_1+x_2+x_3+x_4+x_5+c=12$$
Convince yourself that the number of nonnegative integer solutions to this equation is the same as the number of solutions to the first inequality.
Using stars and bars, we have that the number of nonnegative integer solutions to
$$\sum_{i=1}^k a_i=n$$
is $\binom{n+k-1}{k-1}$.
We can apply this theorem to see that the number of ways to grab the colored balls is $\binom{12+6-1}{6-1}=\binom{17}{5}=6188$.
However, this includes the solution when $x_1,x_2,x_3,x_4,x_5=0$, which is explicitly stated in the problem to be excluded. Hence our final answer is $\boxed{6187}$.