from math import sqrt
N, L = map(int, input().split())
max_interval = int(L//(N-1))

primes = set(range(3, max_interval+1, 2))
if max_interval >= 2:
    primes.add(2)

du = primes.difference_update
for i in range(3, int(sqrt(max_interval))+1, 2):
    if i in primes:
        du(range(i*3, max_interval+1, i*2))

print((L+1)*len(primes)+(1-N)*sum(primes))