Primes_MAX = 200
Primes = []
Sieve = [0] * Primes_MAX
Sieve[0] = Sieve[1] = -1
for p in range(2, Primes_MAX):
    if not Sieve[p]:
        Primes.append(p)
        Sieve[p] = p
        for q in range(p * p, Primes_MAX, p):
            if not Sieve[q]:
                Sieve[q] = p

def f(x):
    return 1 + x * (1 + x * (-1 + x))

a, b = map(int, input().split())
ans = sum(f(p) for p in Primes if a <= p <= b)
print(ans)