// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
 
signed main() {
    int N, D; cin >> N >> D;
    // map<int, int> lhs;
    vector<int> lhs, rhs;
    for(int i=1; i<=N; i++) {
        for(int j=1; j<=N; j++) {
            lhs.push_back(i*i + j*j);
            rhs.push_back(i*i - j*j + D);
        }
    }

    // fprintf(stderr, "sort start\n");
    sort(lhs.begin(), lhs.end());
    sort(rhs.begin(), rhs.end());
    // fprintf(stderr, "sort end\n");
    int ans = 0;
    int il = 0, ir = 0;
    for(auto x : lhs) {
        // int x = e.first, y = e.second;
        int y = 1;
        while(ir < rhs.size() and rhs[ir] <= x) ir++;
        while(il < rhs.size() and rhs[il] <  x) il++;
        ans += (ir - il) * y;
    }
    cout << ans << endl;
    return 0;
}