#include<bits/stdc++.h>
#define rep(i,l,r) for(auto i(l),i##_end(r);i<=i##_end;++i)
#define per(i,r,l) for(auto i(r),i##_end(l);i>=i##_end;--i)
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define SZ(a) ((int)(a).size())

using namespace std;
using cint=const int;
using ll=long long;
using cll=const long long;
using ull=unsigned long long;
#if __SIZEOF_POINTER__==8
using lll=__int128;
#endif
using db=double;
using ld=long double;
using pii=pair<int,int>;
using vi=vector<int>;
using vii=vector<pii>;
mt19937 rnd(random_device{}());
mt19937_64 rnd64(random_device{}());

void debug()
{
	cerr<<"\n";
}
template<typename T,typename ...Args>
void debug(T t,Args ...args)
{
	cerr<<t;
	if(sizeof...(args)) cerr<<", ";
	debug(args...);
}
#define deb(x...) do{ cerr<<#x<<": "; debug(x); }while(0)

template<typename T>
bool cmax(T &a,const T &b){ return b>a?a=b,1:0; }
template<typename T>
bool cmin(T &a,const T &b){ return b<a?a=b,1:0; }

const int N=2e5+5,INF=1e9;
int S,C;
int f[N*2],t[N*2];
int main()
{
	scanf("%d%d",&S,&C); C/=2;
	rep(i,1,2*S) f[i]=INF;
	f[0]=0;
	rep(i,1,(int)sqrt(S))
	{
		int ra=2*i-1;
		rep(j,0,ra-1) t[j]=INF;
		int rj=0,rji=0,cj=0,cji=0;
		rep(j,0,2*S)
		{
			cmin(t[j%ra],f[j]-j/ra);
			cmin(f[j],t[(j+i)%ra]+(j+i)/ra+i);
		}
	}
	f[0]=2;
	ll ans=0;
	rep(i,0,2*S)
	{
		ans+=(max(min(C,2*S-i)+1-f[i],0)+1)/2;
	}
	printf("%d\n",ans);
}