#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<int,P> Q;
 
const int inf = (int)1e9; 
 
ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

 
 
int main(void){
	ll n,d;
	cin>>n>>d;
	vector<int>v1,v2;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			v1.push_back(i*i+j*j);
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(d+i*i-j*j>=0 && d+i*i-j*j<=2*n*n){
				v2.push_back(d+i*i-j*j);
			}
		}
	}
	ll ans = 0;
	sort(v2.begin(),v2.end());
	for(int i=0;i<v1.size();i++){
		int index1 = upper_bound(v2.begin(),v2.end(),v1[i])-v2.begin();
		int index2 = lower_bound(v2.begin(),v2.end(),v1[i])-v2.begin();
		ans+=index1-index2;
	}
	cout<<ans<<endl;
	return 0;
}