#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=1e6+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m;
ll ans;
void find(int k1,int b1,int k2,int b2,int lim){
	if(2ll*k2*lim+b2>n||2ll*k1*lim+b1>m) return;
	// gdb(k1,b1,k2,b2,lim);
	ans+=min((n-b2)/k2/2,k1?(m-b1)/k1/2:INF)-lim+1;
	if(2ll*k2*lim+b2<=m&&2ll*k1*lim+b1<=n) ans+=min(k1?(n-b1)/k1/2:INF,(m-b2)/k2/2)-lim+1;
	for(int i=1;b1+2*i*b2<=n&&2ll*(k1+2*i*k2)*max(lim,i)+b1+2*i*b2<=n;i++){
		find(k2,b2,k1+2*i*k2,b1+2*i*b2,max(lim,i));
	}
}
void dfs(int x,int y,int lim){
	if(x+2ll*lim*y>n) return;
	find(0,y,y,x,lim);
	for(int i=1;x+2*i*y<=n&&y+2ll*max(lim,i+1)*(x+2*i*y)<=n;i++){
		dfs(y,x+2*i*y,max(lim,i+1));
	}
}
void Solve(){
	scanf("%d%d",&n,&m);
	if(n<m) swap(n,m);
	dfs(0,1,1);
	printf("%lld\n",ans);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}