finding primes using chebyshev bias

Using the problem from my previous question link. For each n, that is n= $10^3$ to $10^6$ with a ten-fold increase, how do I use Chebyshev Bias to display the number of primes (which are in the remainder class 1 and 3, both divided by 4)?

When I programmed it, it shows me primes starting from 7000s. However, according to link, I am not getting the same list of prime numbers. I’m not sure if I understood what they meant by divided by for $4$ for the remaining class $1$ and $3$.

Clear[n, m]
m = 10^n;
n = 6;
primes = Prime[Range[10^3, m]]
c1 = Counts[Mod[primes, #]] & /@ {1/4} (*remainder class 1 divided by 4*)
c3 = Counts[Mod[primes, #]] & /@ {3/4} (*remainder class 3 divided by 4*)