#include<bits/stdc++.h>
#define ll long long
#define For(i,a,b) for(register int i=a;i<=b;i++)
using namespace std;
ll n,m,ans;
inline void calc(int mn,int a,int b,int c,int d)
{
    int va=a?(n-b)/a:0x3f3f3f3f;
    int vb=c?(m-d)/c:0x3f3f3f3f;
    int vc=c?(n-d)/c:0x3f3f3f3f;
    ans+=max(0,min(va,vb)-mn+1)+max(0,vc-mn+1);
    For(i,1,m)
    {
        ll na=c,nb=d,nc=2ll*i*c+a,nd=2ll*i*d+b,nx=max(mn,i+1);
        if(1ll*na*nx+nb > n || 1ll*nc*nx+nd > m) break;
        calc(nx,na,nb,nc,nd);
    }
    return;
}

inline void dfs(int mn,int a,int b)
{
    For(i,1,m)
    {
        ll na=b,nb=2ll*i*b+a,nx=max(mn,i);
        if(nb > n || 2ll*nx*nb+na > m) break;
        dfs(nx,na,nb);
    }
    return calc(mn,0,b,b<<1,a);
}

int main()
{
    scanf("%lld%lld",&n,&m);
    if(n > m) swap(n,m);
    calc(1,0,1,2,0);
    int lim=sqrt(m-1>>2);
    For(i,1,lim) dfs(i,1,i<<1);
    printf("%lld\n",ans);
    return 0;
}