#include <iostream>
#include <algorithm>
#include <vector>
#include <map>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); i++)

const int MOD = 1e9 + 7;

struct mint {
    int n;
    mint(int n_ = 0) : n(n_) {}
};

mint operator+(mint a, mint b) { a.n += b.n; if (a.n >= MOD) a.n -= MOD; return a; }
mint operator-(mint a, mint b) { a.n -= b.n; if (a.n < 0) a.n += MOD; return a; }
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }

int main() {
  int N, D;
  cin >> N >> D;
  map<int, int> mp1;
  map<int, int> mp2;
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= N; j++) {
      mp1[i*i + j*j]++;
      mp2[i*i - j*j + D]++;
    }
  }
  long long ans = 0;
  for (auto e : mp1) {
    ans += (long long)e.second * mp2[e.first];
  }
  cout << ans << endl;
}