#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

ll memo[8000000+10];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N, D;
    cin >> N >> D;

    FOR(i, 0, 8000000+10){
        memo[i] = -1;
    }

    vector<ll> A;
    FOR(w, 1, N+1){
        FOR(z, 1, N+1){
            ll v = w*w + D - z*z;
            A.push_back(v);
        }
    }
    sort(ALL(A));

    ll count = 0;
    FOR(x, 1, N+1){
        FOR(y, 1, N+1){
            ll v = x*x + y*y;
            if(memo[v]!=-1){
                count += memo[v];
            }
            else{
                auto it = lower_bound(ALL(A), v);
                auto it2 = upper_bound(ALL(A), v);
                ll dist = distance(it, it2);

                count += dist;
                memo[v] = dist;
            }
        }
    }

    p(count);
    
    return 0;
}