#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using u64 = uint_fast64_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln =  '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; }
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
void print() { cout << "\n"; }
template<class T, class... Args>
void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////

const int MAX = 5000000;
int cnt[MAX+1];
int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N,D; cin >> N >> D;

    for (int x = 1; x <= N; x++) {
        for (int y = 1; y <= N; y++) {
            int k = x*x + y*y;
            if (k <= MAX) cnt[k]++;
        }
    }

    ll ans = 0;
    for (int w = 1; w <= N; w++) {
        for (int z = 1; z <= N; z++) {
            int k = w*w - z*z + D;
            if (0 < k) ans += cnt[k];
        }
    }

    cout << ans << ln;
}