Generally speaking, we want the remainder to be positive, as in the case of the Division Algorithm for integers:
If $m$ is a positive integer divisor and $n$ is any integer dividend, then there exists unique integers $q$ (quotient) and $r$ (remainder) such that $$n = mq+r, \quad \text{and}\;0\leq r\lt m.$$
(Note: the Division Algorithm addresses integers divided by positive divisors.)
To see how this works, we can use the number line to approach all such remainder questions.
Let's model what we do in the positive dividend case. Say we want to calculate the remainder when $10$ is divided by $3$. $$\dfrac {10}{3} = 3\times 3 + 1$$
That is, $9$ is the greatest integer less than or equal to $10$ that is divisible by $3$. This appears on the number line one integer unit to the left of $10$. So our remainder is $10 - 9 = 1$.
In the negative dividend case, we can do likewise. $$\dfrac{-8}{3} = -3\times 3 + 1$$
$-9$ is the greatest integer less than or equal to $-8$ that is divisible by $3$. It appears one unit to the left of the dividend $-8$ on the number line. So the remainder is $-8 - (-9) = +1$.