// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(18);
}
#define MAX 2*(2100*2100)
vector<ll> mv(MAX,0);
signed main(){
  init_io();
  ll n,d,ans=0;
  cin >> n >> d;
  for(ll i=1;i<=n;i++){
    for(ll j=1;j<=n;j++){
      mv[i*i+j*j]++;
    }
  }
  for(ll w=1;w<=n;w++){
    for(ll z=1;z<=n;z++){
      ll x = d + w*w - z*z;
      if(x>=0&&x<MAX){
        ans += mv[x];
      }
    }
  }
  cout << ans << endl;
}