#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,D,x,y,z,w;

struct XY {
    int x,y;
    XY() {};
    XY(int x, int y): x(x), y(y) {};
};

void solve() {
    cin>>N>>D;
    // x >= y >= z;
    map<int, vector<XY>> M;
    FOR(x,1,N+1) FOR(y,1,x+1) {
        int s = x*x + y*y;
        M[s].push_back(XY(x,y));
    }
    int ans = 0;
    FOR(w,1,N+1) {
        int ma = w*w+D;
        for(z=1; z<=N+1 && z*z*3<=ma; z++) {
            int t = ma - z*z;
            if (t <= 0) continue;
            auto it = M.find(t);
            if (it == M.end()) continue;
            for (auto xy : it->second) {
                if (xy.y < z) continue;
                vector<int> a{xy.x,xy.y,z};
                UNIQUE_SORT(a)
                switch(a.size()) {
                    case 1: ans += 1; break;
                    case 2: ans += 3; break;
                    default: ans += 6; break;
                }
            }
        }
    }
    
    cout << ans << endl;
}