#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repeat(i,s,n) for(int (i)=s; (i)<(n); (i)++)
#define revrep(i,n) for(int (i)=(n)-1;i>=0; i--)

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<setprecision(std::numeric_limits<float>::max_digits10);
  ll N,D;
  cin>>N>>D;
  vector<int> xy_ans(8000000+1);
  repeat(x,1,N+1) {
    repeat(y,1,N+1) {
      xy_ans[x*x+y*y]++;
    }
  }
  ll ans=0;
  repeat(z,1,N+1) {
    repeat(w,1,N+1) {
      ll c=D+w*w-z*z;
      if(c>=0) {
        ans+=xy_ans[c];
      }
    }
  }
  cout << ans << endl;
  return 0;
}