n, l = map(int, input().split())
k = n - 1
d_max = l // k

if d_max < 2:
    print(0)
else:
    sieve = [True] * (d_max + 1)
    sieve[0] = sieve[1] = False
    for i in range(2, int(d_max ** 0.5) + 1):
        if sieve[i]:
            sieve[i*i : d_max+1 : i] = [False] * len(sieve[i*i : d_max+1 : i])
    primes = [d for d, is_p in enumerate(sieve) if is_p]
    total = sum((l - k * d + 1) for d in primes)
    print(total)