#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<utility>
#include<cmath>
#include<assert.h>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<complex>

#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound

int xy[2000 * 2000];
int zw[2000 * 2000];

signed main() {
    int n, d;
    cin >> n >> d;
    for (int x = 1; x <= n; ++x) {
        for (int y = 1; y <= n; ++y) {
            xy[(x - 1) * n + (y - 1)] = x * x + y * y;
            zw[(x - 1) * n + (y - 1)] = x * x - y * y;
        }
    }
    sort(xy, xy + n * n);
    sort(zw, zw + n * n);
    int ans = 0;
    rep(i, n * n) {
        ans += u_b(zw, zw + n * n, d - xy[i]) - l_b(zw, zw + n * n, d - xy[i]);
    }
    cout << ans << endl;
    return 0;
}