import sys

def MI(): return map(int, sys.stdin.buffer.readline().split())

n, d = MI()
lim = 2*n*n
cnt1 = [0]*(lim+1)
cnt2 = [0]*(lim+1)

for x in range(1, n+1):
    s = x*x
    for y in range(1, n+1):
        t = y*y
        cnt1[s+t] += 1
        if 0 <= s+d-t <= lim: cnt2[s+d-t] += 1

ans=sum(c1*c2 for c1,c2 in zip(cnt1,cnt2))
print(ans)