#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n,d;
vector<int>a;
main()
{
	cin>>n>>d;
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)a.push_back(i*i-j*j);
	sort(a.begin(),a.end());
	int ans=0;
	for(int i=1;i<=n;i++)for(int j=i;j<=n;j++)
		ans+=(upper_bound(a.begin(),a.end(),i*i+j*j-d)-lower_bound(a.begin(),a.end(),i*i+j*j-d))*(1+(i<j));
	cout<<ans<<endl;
}