#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;

ll dp[205][300000];

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<vector<int>> nx(m, vector<int>(n+1)); // nx[i][j] = v[i]/j
    // for(int i = 0; i < m; i++){
    //     for(int j = 1; j <= n; j++){
    //         ll x = v[i]/j;
    //         if(x == 0) nx[i][j] = -1;
    //         else nx[i][j] = inv[x];
    //     }
    // }
    dp[n][m-1] = 1;
    for(int i = n; i >= 1; i--){
        for(int j = 0; j < m; j++){
            dp[i-1][j] += dp[i][j];
            int k = nx[j][i];
            if(k == -1) continue;
            dp[i-1][k] += dp[i][j];
        }
        // for(int j = 0; j < m; j++) cout << dp[i-1][j] << ' ';
        // cout << endl;
    }
    ll ans = 0;
    for(int i = 0; i < m; i++) ans += dp[0][i];
    cout << ans-1 << endl;
}