#include <bits/stdc++.h>
#include <type_traits>
using namespace std;

using ll=int64_t;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(),x.end()
auto& errStream=cerr;
#ifdef LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class CerrDummy{}cerrDummy;
template<class T>
CerrDummy& operator<<(CerrDummy&cd,const T&){
	return cd;
}
using charTDummy=char;
using traitsDummy=char_traits<charTDummy>;
CerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){
	return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr<<"reached"<<endl
#define DMP(x) cerr<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))
#define ONE(x) memset(x,-1,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"{";
	REP(i,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"(";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<")";
}

ll read(){
	ll i;
	scanf("%"  SCNd64,&i);
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(ll x,int suc=1){
	printf("%" PRId64,x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

constexpr ll Ten(int n){
	return n==0?1:Ten(n-1)*10;
}

template<class T>
vector<T> Uniqued(const vector<T>&vv){
	auto v(vv);
	sort(ALL(v));
	v.erase(unique(ALL(v)),v.end());
	return v;
}
template<class T>
void MakeUniqued(vector<T>&v){
	sort(ALL(v));
	v.erase(unique(ALL(v)),v.end());
}

const int P=2000000011LL;

bool above(pi x,pi y,pi z){
	int c=(y.first-x.first)*(z.second-x.second)-(y.second-x.second)*(z.first-x.first);
	return c>=0;
}

pi sub(int k,int x){
	int mx=0;
	{
		int cur=0;
		while(cur<k){
			mx++;
			cur+=mx;
		}
	}
	int lw=0,up=k*x;
	while(up-lw>1){
		const int mid=(up+lw)/2;
		int cnt=0;
		REP(b,mx){
			int rem=mid-b*P;
			if(rem>=0){
				cnt+=rem/x+1;
			}
		}
		if(cnt<=k)
			lw=mid;
		else
			up=mid;
	}
	pi ans(0,0);
	REP(b,mx){
		int rem=lw-b*P;
		if(rem>=0){
			int cnt=rem/x+1;
			ans.first+=cnt*(cnt-1)/2;
			ans.second+=b*cnt;
		}
	}
	return ans;
}

bool Check(int r,int b,int k){
	if(r<b)swap(r,b);
	{
		pi y=sub(k,P-1);
		pi x=pi(y.second,y.first);
		if(x.first<=r&&r<=y.first)
			return above(x,y,pi(r,b));
	}
	int lw=1,up=P-1;
	while(up-lw>1){
		const int mid=(up+lw)/2;
		pi w=sub(k,mid);
		if(w.first<=r&&w.second<=b)
			return true;
		if(r<=w.first&&b<=w.second)
			return false;
		if(w.first<=r){
			up=mid;
		}else{
			lw=mid;
		}
	}
	
	pi x=sub(k,up);
	pi y=sub(k,lw);
	return above(x,y,pi(r,b));
}

signed main(){
	int r=read(),b=read();
	int lw=0,up=0;
	{
		int cur=0,head=0;
		while(cur<=r+b){
			up+=head+1;
			cur+=head*(head+1);
			head++;
		}
		cerr<<up<<endl;
	}
	while(up-lw>1){
		const int mid=(lw+up)/2;
		if(Check(r,b,mid))
			lw=mid;
		else
			up=mid;
	}
	print(lw-1);
}


Measured memory_bytes: 384