#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

unordered_map<ll, ll> memo[201];
ll keisan(ll N, ll K) {
	if (N == 0) return 1;
	if (memo[N].find(K) != memo[N].end()) {
		return memo[N][K];
	}
	ll ret = 0;
	if (K >= N) {
		ret += keisan(N - 1, K / N);
	}
	ret += keisan(N - 1, K);

	memo[N][K] = ret;
	return ret;
}

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


	ll N, K;
	cin >> N >> K;

	ll kotae = keisan(N, K);

	co(kotae - 1);


	Would you please return 0;
}