# Primitive Characters

Let $\chi$ be the primitive character modulo 12.
I need to find all possible values of $\underset{m\leq x}{\sum}\chi(m)$ for varying $x$ (not necessarily an integer).