#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define INF 1145141919
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int ny, nx;
typedef long long int ll;
using namespace std;

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }

ll lcm(ll m, ll n)
{
    if ((0 == m) || (0 == n))
        return 0;
    return ((m / gcd(m, n)) * n);
}

ll llpow(ll x, ll y)
{
    ll ans = 1;
    REP(i, y)
    ans *= x;
    return ans;
}

int ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return 0;
}
ll ans = 0;
ll cnt[100000000];
////////////////////////////////////////////////////////////////////
int main()
{
    ll N, D; cin >> N >> D;

    FOR(x,1,N+1){
        FOR(y,1,N+1) cnt[x*x+y*y]++;
    }
    FOR(z,1,N+1) FOR(w,1,N+1){
        ll res = D + w*w - z*z;
        if(res>0) ans+=cnt[res];
    }

    cout << ans << endl;
    return 0;

}