#include <iostream>
#include <map>

using namespace std;
using lint = unsigned long long;

void solve() {
    lint n;
    cin >> n;

    map<lint, lint> dp;
    {
        int k;
        cin >> k;
        dp[k] = 1;
    }

    for (lint x = 1; x <= n; ++x) {
        map<lint, lint> ndp = dp;
        for (auto [k, p] : dp) {
            if (k < x) continue;
            ndp[k / x] += p;
        }
        swap(dp, ndp);
    }

    lint ans = -1;
    for (auto [k, p] : dp) ans += p;
    cout << ans << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}