//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

#include <atcoder/modint>
using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
V<T> make_vec(size_t a) {
    return V<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

template <class T>
auto operator<<(ostream& os, T t) ->
    typename std::enable_if_t<internal::is_modint<T>::value, ostream&> {
    os << t.val();
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

unordered_map<ll, ull> T[210];

V<pair<ll, ll>> enum_quotient(ll N) {
    V<pair<ll, ll>> res;
    ll l = 1;
    while (l <= N) {
        ll r = N / (N / l) + 1;
        //[l, r)
        res.emplace_back(l, r);
        l = r;
    }
    return res;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int N;
    ll K;
    cin >> N >> K;

    auto v = enum_quotient(K);
    V<ll> up;
    for (auto x : v) up.pb(K / x.fi);
    reverse(ALL(up));

    auto dp = make_vec<ull>(N + 2, SZ(up));

    rep(i, SZ(up)) dp[N + 1][i] = 1;

    for (int i = N; i >= 1; --i) {
        int pt = 0;
        rep(j, SZ(up)) {
            dp[i][j] += dp[i + 1][j];
            int nx = up[j] / i;
            if (nx > 0) {
                while (pt < SZ(up) && up[pt] < nx) pt++;
                dp[i][j] += dp[i + 1][pt];
            }
        }
    }

    cout << dp[1][SZ(up) - 1] - 1 << endl;

    return 0;
}