#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>


using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define INF64 1999999999999999999
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007

ll n, d, ans = 0;
vector<ll> memo(5000000, -1);

ll s(ll a) {
	if (a < 0)a *= -1;
	if (memo[a] != -1)return memo[a];
	if (a == 0)return n;
	ll res = 0;
	for (ll i = 1; i <= min(n, (ll)sqrt(a)); i++)
	{
		if (a % i == 0) {
			if (a / i <= i)break;
			if (abs(i - a / i) % 2 == 0 and i <= n and i + abs(i - a / i) / 2 <= n)res++;
		}
	}
	memo[a] = res;
	return res;
}
int main() {
	cin >> n >> d;
	REPO(i, n) {
		REPO(j, n) {
			ll now = i * i + j * j - d;
			ans += s(now);
		}
	}
	cout << ans << endl;
}