#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
//-------------------
constexpr int MX = 2e3 * 2e3 * 2 + 3;
int mp1[MX];
int mp2[MX];
int main() {
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    int n,d; cin >> n >> d;
    // unordered_map<int, int> mp1;
    FOR(x,1,n) {
        FOR(y,1,n) {
            mp1[x*x+y*y]++;
        }
    }

    // unordered_map<int, int> mp2;
    FOR(z,1,n) {
        FOR(w,1,n) {
            if(w*w+d-z*z > 1)
            mp2[w*w+d-z*z]++;
        }
    }

    ll ans = 0;
    rep(i, MX-1) {
        ans += mp1[i] * mp2[i];
    }

    cout << ans << endl;
    return 0;
}