#include <bits/stdc++.h>
#include <variant>

#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif

using namespace std;
using namespace std::string_literals;

using i32 = int32_t;
using i64 = int64_t;
using f64 = double;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;

//using namespace harudake;

map<pair<i64,i64>,i64> memo;

i64 solve(i64 n, i64 k) {
  if (memo.count(make_pair(n,k))) {
    return memo.at(make_pair(n,k));
  }
  if (k == 0) {
    return 0;
  }
  if (n == 1) {
    return 2;
  }
  i64 ans = solve(n-1, k) + solve(n-1, k/n);
  memo[make_pair(n,k)] = ans;
  return ans;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  i64 n,k;
  cin>>n>>k;
  cout<<solve(n,k)<<endl;

  return 0;
}