A polynomial modulo the square of a prime (noch nicht übersetzt)

Let f(n) = n² - 3n - 1.
Let p be a prime.
Let R(p) be the smallest positive integer n such that f(n) mod p² = 0 if such an integer n exists, otherwise R(p) = 0.

Let SR(L) be ∑ R(p) for all primes not exceeding L.

Find SR(10⁷).