#include "bits/stdc++.h"
#define Rep(i,n) for(int i=0;i<n;i++)
#define For(i,n1,n2) for(int i=n1;i<n2;i++)
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define put(a) cout<<a<<endl;
#define all(a)  (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define TDARRAY(int,a,n,m) vector<vector<int>> a(n,vector<int>(m,0));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) {if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a, T b) {if(a>b){a=b;return 1;}return 0;}

int n,d;
vector<int> e;
map<int,int> mp;
int binary_search(int x){
    auto itr = lower_bound(all(e), x);
    if(x==*itr)return mp[x];
    else return 0;
}

int main(){
    cin >> n >> d;
    vector<int> a(n);
    vector<int> b(n);
    REP(i,n){
        a[i]=b[i]=i+1;
    }
    e.resize(n*n);
    REP(i,n){
        REP(j,n){
            int c = a[i]*a[i]+b[j]*b[j];
            e[i*n+j] = c;
            auto itr = mp.find(c);
            if(itr!=mp.end()){
                mp[c]++;
            }else{
                mp[c]=1;
            }
            
        }
    }
    SORT(e);
    ll res = 0;
    REP(i,n){
        REP(j,n){
            int x = d+(i+1)*(i+1)-(j+1)*(j+1);
            res+=binary_search(x);
        }
    }
    put(res);
    return 0;
}