def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n ** 0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return (i for i in range(n + 1) if is_prime[i])


N, L = map(int, input().split())
ans = 0
for d in primes(L // (N - 1) + 1):
    if (length := (N - 1) * d) > L:
        break
    ans += L - length + 1
print(ans)