#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;

ll cnt[100000000] = {0};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll N, D;
    cin >> N >> D;
    ll ans = 0;
    map<ll, ll> ma;

    for (int x = 1; x <= N; x++) {
        for (int y = 1; y <= N; y++) {
            ll tmp = x * x + y * y;
            if (tmp > 100000000)
                continue;
            cnt[tmp]++;
        }
    }

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

    cout << ans << endl;
}