import math

ans = 0
def prime_judge(num):
    if num == 1:
        return False
    p=2
    ans=True
    n = math.isqrt(num)
    while p <= n:
        if num%p == 0:
            ans=False
            break
        p += 1
    return ans


A, B = (int(x) for x in input().split())
for i in range(A, B+1):
    if prime_judge(i):
        ans += i*i*i-i*i+i+1

print(ans)