import sys
input=lambda: sys.stdin.readline().rstrip()
n,l=map(int,input().split())
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]]
if n==1:
  print(l+1)
elif l<2*(n-1):
  print(0)
else:
  P=primes(l//(n-1))
  ans=0
  for p in P:
    if (n-1)*p>l:
      break
    else:
      ans+=l-(n-1)*p+1
  print(ans)