import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, D;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      D = readInt();
      
      int[] ps, qs;
      foreach (x; 1 .. N + 1) {
        foreach (y; 1 .. N + 1) {
          ps ~= x^^2 + y^^2;
          qs ~= x^^2 - y^^2;
        }
      }
      ps.sort;
      qs.sort;
      const psLen = cast(int)(ps.length);
      const qsLen = cast(int)(qs.length);
      int pos;
      long ans;
      for (int i = 0, j; i < psLen; i = j) {
        for (j = i; j < psLen && ps[i] == ps[j]; ++j) {}
        long tmp;
        for (; pos < qsLen && qs[pos] < ps[i] - D; ++pos) {}
        tmp -= pos;
        for (; pos < qsLen && qs[pos] <= ps[i] - D; ++pos) {}
        tmp += pos;
        ans += (j - i) * tmp;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}