#include <bits/stdc++.h>

using namespace std;
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define ii pair<ll, ll>
using ll = long long int;
#define pb push_back
#define ss second
#define ff first
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define nl "\n"
#define br cout << "\n";
#define all(a) a.begin(), a.end()
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
// #define mod 419
// #define mod 1000000007
// #define mod 10000000002065383
const int N = 2e5 + 100;
// const int M = 1000000000;

#ifndef ONLINE_JUDGE
#include "bits/debug.h"
#else
#define debug(...) 42
#endif

template<typename T>
istream& operator>>(istream& in, vector<T>& v) {
    for (auto& elem : v) {
        in >> elem;
    }
    return in;
}

void print(vi &v)
{
    for (auto x : v)
        cout << x << " ";
    cout << endl;
}

void solve() {
    ll n,d; cin >> n >> d;
    ll N = 6e6 + 200;
    vector<ll>  mpa(N),mpb(N);

    for(ll i=1; i<=n; i++){
        for(ll j=1; j<=n; j++){
            ll a = i*i + j*j;
            ll b = i*i - j*j + d;

            if(a<N)  mpa[a] ++;
            if(b>0 &&  b<N) mpb[b]++;
        }
    }

    ll ans = 0;
    for(ll i =1; i <N ;i++){
        ans += mpa[i] * mpb[i];
    }
    cout << ans << nl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int Test = 1;
    // cin >> Test;

    while (Test--) 
    {
        solve();
    }
    return 0;
}