N, L = map(int, input().split())

def prime(x):
    prime = [x if x%2==1 else 2 for x in range(x+1)]
    prime[0] = 1

    for i in range(3, int(x**0.5)+2, 2):
        if prime[i] != i:
            continue   
        for j in range(2*i, x+1, i):
            if prime[j] == j:
                prime[j] = i

    p = {i for i in range(2, x+1) if prime[i] == i}
    return p

ans = 0
P = prime(L//(N-1)+10)
for p in P:
    a = max(0, L+1-(N-1)*p)
    ans += a
print(ans)