#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main() {
  ll n, d;std::cin >> n >> d;
  map<ll, ll> pl;
  map<ll, ll> mi;
  for(ll i=1;i<=n;i++){
    for(ll j=1;j<=n;j++){
      ll x = i*i+j*j;
      auto itr = pl.find(x);
      if(itr==pl.end()) pl.emplace(x, 1);
      else (*itr).second++;

      ll y = i*i-j*j+d;
      itr = mi.find(y);
      if(itr==mi.end()) mi.emplace(y, 1);
      else (*itr).second++;
    }
  }
  ll ans = 0;
  for(auto p:pl){
    auto itr = mi.find(p.first);
    if(itr==mi.end()) continue;
    ans += p.second * (*itr).second;
  }
  std::cout << ans << '\n';
}