#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
int main(){
     ll n,k;
     cin>>n>>k;
     map<ll,ll,greater<ll>> dp;
     dp[k]=1;
     ll ans=0;
     for(ll i=1;i<=n;i++){
         V<P> tmp;
            for(auto &p:dp){
                 if(p.fi/i==0)break;
                 tmp.emplace_back(p.fi/i,p.se);
            }
            for(P &p:tmp){
                    dp[p.fi]+=p.se;
            }
     }
     for(auto &p:dp){
           ans+=p.se;
     }
     ans--;
     cout<<ans<<"\n";
}