#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;
 
typedef long long ll;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=b-1LL;i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define endl "\n"
#define print(x) cout<<#x<<" = "<<x<<endl;
 
#define MOD 1000000007

ll dd[8000100];

int main(){
	clr(dd,0);
	ll n,d;
	cin>>n>>d;
	vector<ll> v;
	rep(i,1,n+1){
		rep(j,1,n+1){
			v.pb(i*i-j*j);
		}
	}
	rep(i,1,n+1){
		rep(j,1,n+1){
			dd[i*i+j*j]++;
		}
	}
	ll ans = 0;
	rep(i,0,v.sz){
		if(v[i]+d>=0){
			ans += dd[v[i]+d];
		}
	}
	cout << ans << endl;
	return 0;	
}