#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;


const int MAX_N = 2e3;
const int SZ = 2*MAX_N*MAX_N+10;
ll cnt[SZ];

int main(){
    ll n, d;
    cin >> n >> d;
    REP(x, 1, n+1) REP(y, 1, n+1) ++cnt[(ll)x*x+(ll)y*y];
    ll ans = 0LL;
    REP(z, 1, n+1) REP(w, 1, n+1) {
        ll xy = (ll)w*w+d-ll(z*z);
        if(xy >= 0 && xy <SZ) ans+=cnt[xy];
    }
    cout << ans << '\n';
    return 0;
}