#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int sz = 2 * 2000 * 2000;
int a[sz + 1] = { 0 };
int b[sz + 1] = { 0 };

int main() {
	int N, D;
	cin >> N >> D;

	for (int x = 1; x <= N; ++x) {
		for (int y = 1; y <= N; ++y) {
			++a[x*x + y*y];
		}
	}
	for (int z = 1; z <= N; ++z) {
		for (int w = 1; w <= N; ++w) {
			int t = w*w + D - z*z;
			if ((t > 0) && (t <= sz)) { ++b[t]; }
		}
	}

	int res = 0;
	for (int i = 0; i <= sz; ++i) { res += (a[i] * b[i]); }
	cout << res << endl;

	return 0;
}