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