#include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

void solve() {
    ll n, k;
    cin >> n >> k;
    auto dfs = [&](auto dfs, ll i, ll p) -> ll {
        ll prod = p * i;
        ll res = 1;
        rep(j, i+1, n+1) {
            if(prod * j > k) break;
            res += dfs(dfs, j, prod);
        }
        return res;
    };
    ll ans = 0;
    rep(i, 1, n+1) ans += dfs(dfs, i, 1);
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}