#include <bits/stdc++.h>
using namespace std;

#define rep(i,j,n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(), i.rend()
#define INF 1e9
#define LINF 1e18
const int mod = 1e9 + 7;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcd(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

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

  int n, d;
  cin >> n >> d;

  map<int, i64> mp1, mp2;
  rep(i, 1, n + 1) {
    rep(j, 1, n + 1) {
      mp1[i * i + j * j]++;
      mp2[i * i - j * j + d]++;
    }
  }

  i64 ans = 0;
  for(auto &it : mp1) {
    if(mp2.count(it.first)) {
      ans += it.second * mp2[it.first];
    }
  }
  cout << ans << endl;
}