#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, d;
    cin >> n >> d;
    vector<int> v1;
    for (int x = 1; x <= n; x++) {
        for (int y = 1; y <= n; y++) {
            v1.push_back(x * x + y * y);
        }
    }
    sort(v1.begin(), v1.end());

    vector<int> v2;
    for (int w = 1; w <= n; w++) {
        int lim = min(n * n, w * w + d);
        for (int z = 1; z * z <= lim; z++) {
            v2.push_back(d + w * w - z * z);
        }
    }
    sort(v2.begin(), v2.end());

    int i = 0, j = 0;
    ll ans = 0;
    while (i < v1.size() && j < v2.size()) {
        while (i < v1.size() && j < v2.size()) {
            if (v1[i] == v2[j]) break;
            if (v1[i] < v2[j]) i++;
            else j++;
        }

        int ii = i, jj = j;
        while (i < v1.size()) {
            if (v1[i] != v1[ii]) break;
            i++;
        }

        while (j < v2.size()) {
            if (v2[j] != v2[jj]) break;
            j++;
        }

        ll tmp = i - ii;
        tmp *= j - jj;
        ans += tmp;
    }
    cout << ans << endl;
    return 0;
}