#include<bits/stdc++.h>
using namespace std;
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), lim##i = (b); i < lim##i; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
using ll = long long;


constexpr int m = 4e5;
int pre[202][m+1];
unordered_map<ll, ll> memo[202];

ll dp(int n, ll k) {
  if (k <= m) return pre[n][k];
  if (n == 0) return 1;
  if (memo[n].count(k)) return memo[n][k];
  return memo[n][k] = dp(n-1, k) + dp(n-1, k/n);
}

int main() {
  ll n, k; cin >> n >> k;
  rep(j, 1, m+1) pre[0][j] = 1;
  rep(i, 1, n+1) rep(j, m+1) pre[i][j] = pre[i-1][j] + pre[i-1][j/i];
  cout << (dp(n, k) - 1) << '\n';
}