#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;
using vb=vector<bool>;using vs=vector<string>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<typename T>T read(){T t;cin>>t;return t;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){o<<'('<<p.fst<<", "<<p.snd<<')';return o;}

vi E;

int f(int x, int a) {
  int b = (x - a) / (a + 1);
  if (a + b + a * b == x) return b;
  return -1;
}

void calc(int x) {
  for (int a = 1; ; a++) {
    int b = f(x, a);
    if (b != -1) {
      if (b < a) break;
      if (a * b + a + b == x) {
        E.emplace_back(a);
        E.emplace_back(b);
      }
    }
  }
  sort(all(E));
  E.erase(unique(E.begin(), E.end()), E.end());
}

void Main() {
  int n = read<int>();
  int x = read<int>();

  calc(x);
  int m = sz(E);

  using mii=map<int, int>;
  vector<vector<mii>> dp(n + 1, vector<mii>(m + 1));

  vi T(m);
  rep(i, m) {
    ll z = 1;
    while (z <= x) {
      z *= (E[i] + 1);
      T[i]++;
    }
    T[i]--;
  }

  //cout << "n: "<<n << endl;
  //cout << "x: "<<x << endl;
  //cout << "E:"; rep(ii,sz(E)) cout << ' ' << E[ii]; cout << endl;
  //cout << "m: "<<m << endl;
  //cout << "T:"; rep(ii,sz(T)) cout << ' ' << T[ii]; cout << endl;

  dp[0][0][0] = 1;

  rep(i, n) rep(j, m) {
    int e = E[j];
    forr(pc, dp[i][j]) {
      ll p = pc.fst;
      int c = pc.snd;
      {
        ll q = p + e + p * e;
        if (q <= x) {
          if (T[j] >= n-i-1-1) {
            if (i+1==n && q == x) dp[i+1][j][q] += c;
            else {
              if (q + e + q * e <= x) dp[i+1][j][q] += c;
            }
          }
        }
      }
      {
        if (j+1<=m) {
          if (T[j+1] >= n-i-1) {
            if (p == x) dp[i][j+1][p] += c;
            else if (j+1<m) {
              int f = E[j+1];
              if (f * p + f + p <= x) dp[i][j+1][p] += c;
            }
          }
        }
      }
    }
  }

  int ans = 0;
  rep(i, m+1) {
    ans += dp[n][i][x];
  }
  cout << ans << endl;
}
int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }