#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,nmx) for(int i = 0; i < (int)(nmx); i++)
#define rrep(i,nmx) for(int i = (int)(nmx) - 1; i >= 0; i--)
#define all(n) begin(n), end(n)
#define rall(n) rbegin(n), rend(n)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr ll M = 5354228880;

ll solve(int k, int nmx) {
  int v[24];
  __int128 permk = 1;
  rep(i, k) permk *= i + 1;
  ll ans = 0;
  auto dfs = [&](auto self, int i, int nmn, ll rest) {
    if (i == k) {
      if (rest == 0) {
        __int128 cnt = permk;
        for (int l = 0, r = 0; l < k; l = r) {
          __int128 c1 = 1;
          int t = 1;
          while (r < k && v[r] == v[l]) c1 *= t++, r++;
          cnt /= c1;
        }
        ans += cnt;
      }
      return;
    }
    if (!(M / nmx * (k - i) <= rest && rest <= M / nmn * (k - i))) return;
    for (int n = nmn; n <= nmx; n++) {
      v[i] = n;
      self(self, i + 1, n, rest - M / n);
    }
  };
  dfs(dfs, 0, 1, M);
  return ans;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int k, n;
  cin >> k >> n;
  cout << solve(k, n) << '\n';
}