//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,j,k) for (int i=j;i<=k;++i)
#define per(i,j,k) for (int i=j;i>=k;--i)
ll const inf=4e7;
int n,m,ans;unordered_map<ll,bool>mp;
queue< pair<int,int> >q;
inline void add(int x,int y){
    //1/2<x/y<2
    //y/2y<2x/2y<4y/2y
    int K=__gcd(x,y);
    x/=K,y/=K;
    if (y<2*x && 2*x<4*y) return;
    if (x>n || y>m) return;
    if (!mp[x*inf+y]) mp[x*inf+y]=1,++ans,q.push({x,y});
}
inline void solve(){
    cin>>n>>m;
    q.push({1,2}),mp[inf+2]=1,++ans;
    while (!q.empty()){
        int x=q.front().first,y=q.front().second;q.pop();
        add(y,x),add(x+y+y,y);
        if (x>2*y) add(x-y-y,y);
    }
    cout<<ans<<'\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while (t--) solve();
    cerr<<"Time: "<<(double)clock()/CLOCKS_PER_SEC<<" s\n";
    return 0;
}