#include <iostream>
#include <vector>

using namespace std;
using ll = long long;

template <class T>
inline T sq(T a) { return a * a; }

int main() {
    int N, D;
    cin >> N >> D;
    vector<ll> cnt(sq(N) * 2 + 1, 0);
    for (int x = 1; x <= N; ++x) {
        for (int y = 1; y <= N; ++y) {
            ++cnt[sq(x) + sq(y)];
        }
    }

    ll ans = 0;
    for (int z = 1; z <= N; ++z) {
        for (int w = 1; w <= N; ++w) {
            int val = sq(w) - sq(z) + D;
            if (0 <= val && val <= sq(N) * 2) ans += cnt[val];
        }
    }
    cout << ans << endl;
    return 0;
}