#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n, d;
  cin >> n >> d;
  vector<ll> s(2 * n * n + 1), t(2 * n * n + 1);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      s[i * i + j * j]++;
      if (0 <= i * i - j * j + d) {
        t[i * i - j * j + d]++;
      }
    }
  }
  ll ans = 0;
  for (int i = 1; i <= 2 * n * n; ++i) {
    ans += s[i] * t[i];
  }
  cout << ans << endl;
  return 0;
}