def solve():
  n,d=map(int,input().split())
  cnt=[0]*9000001
  for i in range(1,n+1):
      for j in range(1,n+1):
          s=i*i-j*j+d
          if s>=0:
              cnt[s]+=1
  ans=0
  for i in range(1,n+1):
      for j in range(1,n+1):
        ans+=cnt[i*i+j*j]
  print(ans)
solve()