#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n, d;
    cin >> n >> d;
    const ll MAX_V = 2 * n * n;
    vector<ll> dp(MAX_V + 1, 0);
    reps(i, 1, n + 1) {
        reps(j, 1, n + 1) {
            ll v = i * i + j * j;
            dp[v]++;
        }
    }
    ll ans = 0;
    reps(i, 1, n + 1) {
        reps(j, 1, n + 1) {
            ll v = i * i - j * j;
            ll a = d - v;
            if ((a < 0) || (a > MAX_V)) continue;
            ans += dp[a];
        }
    }
    cout << ans << endl;
    return 0;
}