#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m;ll ans,CNT;
inline int fdiv(int p,int q){return (p+(p<0))/q-(p<0);}
void dfs(int a,int b)
{//printf("dfs(%d,%d)\n",a,b);
	// if(b>m||a>n)return;
	++CNT;
	if(b<=n)ans+=(n-b)/a/2+1;
	ans+=(m-b)/a/2+1;
	int lim=fdiv(n-b,2*a);
	int mxk=min(lim,fdiv(m-2*b-a,4*a));
	int hfk=min(lim,fdiv(m-4*b-a,8*a));
	int mxn=min(mxk,fdiv(n-2*b-a,4*a));
	ans+=max(0,mxn-hfk)+max(0,mxk-hfk);
	for(int k=0;k<=hfk;++k)dfs(b+2*k*a,2*b+(4*k+1)*a);
}
int main()
{
	scanf("%d%d",&n,&m);
	if(n>m)swap(n,m);
	dfs(1,2);
	printf("%lld\n",ans);
	printf("CNT:%lld\n",CNT);
	fclose(stdin);fclose(stdout);return 0;
}