#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int,int> pii;
const int N=1e5+5;
int n,m;
unordered_map<int,int>mp[N];
inline bool Check(int x,int y){
    return 1<=x&&x<=1e5&&1<=y&&y<=1e5&&!mp[x].count(y)&&(y>=2*x||x>=2*y);
}
signed main(){
    // freopen("ex_2.in","r",stdin);
    // freopen(".out","w",stdout);
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n>>m;
    queue<pii>q;
    q.push(pii(1,2)),mp[1][2]=true;
    while(!q.empty()){
        pii u=q.front();q.pop();
        int x=u.fi,y=u.se,tx,ty,g;
        if(Check(y,x))q.push(pii(y,x)),mp[y][x]=true;
        if(x>y*2){
            tx=x-y*2,ty=y,g=__gcd(tx,ty),tx/=g,ty/=g;
            if(Check(tx,ty))q.push(pii(tx,ty)),mp[tx][ty]=true;
        }
        tx=x+y*2,ty=y,g=__gcd(tx,ty),tx/=g,ty/=g;
        if(Check(tx,ty))q.push(pii(tx,ty)),mp[tx][ty]=true;
    }
    int Ans=0;
    for(int i=1;i<=n;++i){
        for(auto j:mp[i])Ans+=j.fi<=m;
    }
    cout<<Ans;
    return 0;
}