#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_XY 8000005

int xy[MAX_XY];
int zw[MAX_XY];
int main() {
    int n, d;
    cin >> n >> d;
    
    srep(i,1,n+1){
        srep(j,1,n+1){
            xy[i*i + j*j]++;
        }
    }

    srep(i,1,n+1){
        srep(j,1,n+1){
            int tmp = d - (i + j) * (i - j);
            if(0 <= tmp)zw[tmp]++;
        }
    }

    int ans = 0;

    rep(i,MAX_XY){
        ans += xy[i] * zw[i];
    }

    cout << ans << endl;
    return 0;
}