#include<bits/stdc++.h>
using namespace std;
const int B=262144;
queue<int>q[B+5];
struct apple{
	int a00,a01,a10,a11;
	apple(int a00=0,int a01=0,int a10=0,int a11=0):
		a00(a00),a01(a01),a10(a10),a11(a11){}
};
apple vc[100005];int tt=0;
void calc(int n,int m){
	queue<pair<pair<int,int>,pair<int,int>>>q;
	q.emplace(make_pair(0,1),make_pair(1,0));
	while(q.size()){
		auto auu=q.front();q.pop();
		auto au=auu.first,ua=auu.second;
		int A=au.first,B=au.second;
		int AA=ua.first,BB=ua.second;
		vc[++tt]=(apple(AA,A,BB,B));
		if(B>n)continue;
		A+=2*B;AA+=2*BB;
		while(A<=m){
			q.emplace(make_pair(B,A),make_pair(BB,AA));
			A+=2*B;AA+=2*BB;
		}
	}
}
int qq[2*B+5];
int c[2*B+5],N;
void add(int x){
	while(x<=N)++c[x],x+=x&-x;
}
void clr(int x){
	while(x<=N)c[x]=0,x+=x&-x;
}
int query(int x){
	int ans=0;
	while(x){
		ans+=c[x];
		x-=x&-x;
	}
	return ans;
}
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	if(n>m)swap(n,m);
	calc(n/B,m/B);
	long long ans=0;
	q[0].emplace(1);
	for(int i=0;i<=B;++i){
		int t=0;
		while(q[i].size()){
			int x=q[i].front();q[i].pop();
			if(x>B){
				qq[++t]=x-2*i;
				continue;
			}
			if(i&&x+2*i<=B)q[i].emplace(x+2*i);
			else if(i)qq[++t]=x;
			if(i<=n&&x<=m)++ans;
			if(x<=n)++ans;
			int A=i+2*x;
			q[x].emplace(A);
		}
		if(i==0)continue;
		N=2*i;
		long long ch=0;
		for(int j=1;j<=t;++j){
			int cu=qq[j];
			ch+=cu/2/i;
			add(2*i-cu%(2*i));
		}
		for(int j=1;j<=tt;++j){
			auto au=vc[j];
			long long sj=m;
			if(au.a01)sj=min(sj,(n-1ll*au.a00*i)/au.a01);
			if(au.a11)sj=min(sj,(m-1ll*au.a10*i)/au.a11);
			if(sj<=B)continue;
			ans+=t*(sj/2/i)-ch;
			ans-=query(2*i-1-sj%(2*i));
			sj=min(sj,(n-1ll*au.a10*i)/au.a11);
			if(sj>B){
				ans+=t*(sj/2/i)-ch;
				ans-=query(2*i-1-sj%(2*i));
			}
		}
		for(int j=1;j<=t;++j)clr(2*i-qq[j]%(2*i));
	}
	printf("%lld\n",ans-2);
	return 0;
}