import numpy as np


def primes_np(n):
    is_prime = np.ones(n + 1, dtype=bool)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n ** 0.5) + 1):
        if not is_prime[i]:
            continue
        is_prime[i * 2:n + 1:i] = False
    return np.where(is_prime)[0].tolist()


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