#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

vector<ll> calc(ll k){
    set<ll> st;
    for(ll i = 1; i*i <= k; i++){
        st.insert(i);
        st.insert(k/i);
    }
    vector<ll> ans;
    for(ll x: st) ans.push_back(x);
    return ans;
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; ll k; cin >> n >> k;
    auto v = calc(k);
    int m = v.size();

    unordered_map<ll, int> inv = [&](){
        unordered_map<ll, int> ans;
        for(int i = 0; i < m; i++) ans[v[i]] = i;
        return ans;
    }();
    vector<ll> dp(m*(n+1)); 
    dp[(m-1)*(n+1)+n] = 1;
    for(int i = n; i >= 1; i--){
        for(int j = 0; j < m; j++){
            if(dp[j*(n+1)+i] == 0) continue;
            dp[j*(n+1)+i-1] +=  dp[j*(n+1)+i];
            ll x = v[j]/i;
            if(x == 0) continue;
            dp[inv[x]*(n+1)+i-1] +=  dp[j*(n+1)+i];
        }
    }

    ll ans = 0;
    for(int j = 0; j < m; j++) ans += dp[j*(n+1)+0];
    cout << ans-1 << endl;
}