//#include <bits/stdc++.h>

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>


#define INF 10e15
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;


int main() {
    long long int n, d;
    cin >> n >> d;

    vector<long long int> x, y;

    long long int i, j;
    for(i = 1; i <= n; i++){
        for(j = 1; j <= n; j++){
            x.push_back(i*i + j*j);
            
            if(i*i - j*j + d >= 0){
                y.push_back(i*i - j*j + d);
            }
        }
    }

    sort(y.begin(), y.end());

    long long int count = 0;
    for(i = 0; i < x.size(); i++){
        count += upper_bound(y.begin(), y.end(), x[i]) - lower_bound(y.begin(), y.end(), x[i]);
    }

    cout << count << endl;
}