#include using namespace std; using ll = long long; #define all(A) A.begin(),A.end() using vll = vector; #define rep(i, n) for (long long i = 0; i < (long long)(n); i++) using Graph = vector>; ll gcd(ll(a), ll(b)) { ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } int main() { ll N,D; cin>>N>>D; map XY,ZW; for(ll X=1;X<=N;X++){ for(ll Y=1;Y<=N;Y++){ if(X*X+Y*Y<=N*N+D){ XY[X*X+Y*Y]++; } if(X*X+D-Y*Y>=2){ ZW[X*X+D-Y*Y]++; } } } ll an=0; for(auto p:ZW){ an+=ZW[p.first]*XY[p.first]; } cout<