Orders and Primitive Roots · Superchallenge problem

Let $S$ be the sum of all the primitive roots modulo $31$ that lie between $1$ and $30$. Find the remainder when $S$ is divided by $31$.