#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	int N;ll K;cin >> N >> K;
	int D = 3e5;
	vector<vector<ll>> dp(N + 1, vector<ll> (D + 1, 0));
	vector<vector<ll>> dp2(N + 2, vector<ll>(D + 1, 0));
	for (int i = 1;i <= N;i++) {
		//iをはじめて
		if (i <= D) dp[i][i]++;
		for (int j = 1;j <= D;j++) {
			dp[i][j] += dp[i - 1][j];
			if (j * i <= D) dp[i][i * j] += dp[i - 1][j];
		}
	}
	for (int i = N;i >= 1;i--) {
		if (i <= D) dp2[i][i]++;
		for (int j = 1;j <= D;j++) {
			dp2[i][j] += dp2[i + 1][j];
			if (j * i <= D) dp2[i][i * j] += dp2[i + 1][j];
		}
	}
	vector<vector<ll>> sdp(N + 2, vector<ll>(D + 1, 0));
	ll ans = 0;
	for (int i = 1;i <= N;i++) for (int j = 1;j <= D;j++) sdp[i][j] = sdp[i][j - 1] + dp2[i][j];
	for (int i = 1;i <= N;i++) {
		if (i > D) {
		//iだけつかう
		ans++;
		//iよりまえになにもでてこない　かつ　それいこうでいっこいじょうでつかう
		ll t = K / (ll)i;
		ans += sdp[i + 1][t];
		}
		//それよりまえでいっこいじょうつかいそのせきがｊ
		for (int j = 1;j <= D;j++) {
			ll x = (ll)i * (ll)j;
			if (x <= D) continue;
			//それいこうでいっこもつかわない
			if (x <= K) ans += dp[i - 1][j];
			//つかう
			//
			ll t = K / x;
			ans += dp[i - 1][j] * sdp[i + 1][t];
		}
	}
	for (ll j = 1;j <= min(K, (ll)D);j++) ans += dp[N][j];
	cout << ans << endl;
}