#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N; ll K; cin >> N >> K;

    ll M = 1;
    while(M*M <= K) M++;

    vector<vector<ll>> dp1(N+1, vector<ll>(M+1, 0)), dp2(N+1, vector<ll>(M+1, 0));
    dp2[N][1] = 1;

    for(ll i = N; i >= 1; i--){
        for(ll j = 0; j <= M; j++){
            if(j*i <= M) dp2[i-1][j*i] += dp2[i][j];
            dp2[i-1][j] += dp2[i][j];
        }
    }
    rep(i, N+1){
        rep(j, M){
            dp2[i][j+1] += dp2[i][j];
        }
    }

    dp1[0][1] = 1;
    ll ans = 0;

    for(ll i = 0; i < N; i++){
        for(ll j = 0; j <= M; j++){
            ll x = j*(i+1);
            if(x > M){
                ans += dp1[i][j]*dp2[i+1][K/x];
            }
            else{
                dp1[i+1][x] += dp1[i][j];
            }
            dp1[i+1][j] += dp1[i][j];
        }
    }

    rep(i, M+1){
        if(i <= K) ans += dp1[N][i];
    }

    cout << ans-1 << '\n';
}