// 441_E.cpp   2024/08/23 21:44:34
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353, mod1 = 1000000007, inf = 1070000000;
const ll linf = 4610000000000000000;
#define REP(i,x,y) for (auto i = (x); i < (y); i++)
#define RREP(i,x,y) for (auto i = (y) - 1; (x) <= i; i--)
#define ALL(x) (x).begin(), (x).end()
template<class T> bool inr(const T &l, const T &x, const T &r){return (l<=x && x<r);}
template<class T> bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} else return 0;}
template<class T> bool chmin(T &a, const T &b){if(b < a){a = b; return 1;} else return 0;}
#include <atcoder/all>
using namespace atcoder;
#pragma GCC optimize("O3")
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  short K,N;
  cin >> K >> N;
  ll ans = 0;
  if(K == 13)ans++;
  if(K == 17)ans++;
  if(K == 19)ans++;
  if(K == 23)ans++;
  vector<ll> fact,inv,fact_inv;
  auto fact_init = [&fact, &inv, &fact_inv](int N,ll mod){
    fact.resize(N+5);
    fact_inv.resize(N+5);
    inv.resize(N+5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < N+5; i++){
      fact[i] = fact[i-1] * i % mod;
      inv[i] = mod - inv[mod%i] * (mod/i) % mod;
      fact_inv[i] = fact_inv[i-1] * inv[i] % mod;
    }
  };
  auto comb = [&fact, &inv, &fact_inv](int N,int K,ll mod){
    return fact[N] * (fact_inv[K] * fact_inv[N-K] % mod) %mod;
  };
  fact_init(200,mod1);
  vector<vector<int>> com(25,vector<int>(25));
  REP(i,0,25){
    REP(j,0,25){
      com[i][j] = comb(i,j,mod1);
    }
  }
  const unsigned short b = 55440;
  ll p = 1; // 通りの数
  unsigned short v = 0; // 値の合計
  short k = K; // まだ配られていない人数
  function<void(short)> f = [&](short i){
    // cout << "i " << i << endl;
    // cout << "p " << p << endl;
    // cout << "v " << v << " " << (double)v/b << endl;
    // cout << "k " << k << endl;
    if((v == b) && (k == 0)){
      ans += p;
      return;
    }
    if(i == N+1){
      return;
    }
    if(i == 13){f(i+1); return;}
    if(i == 17){f(i+1); return;}
    if(i == 19){f(i+1); return;}
    if(i == 23){f(i+1); return;}
    if(v + k*(b/i) < b){
      return;
    }
    REP(j,(short)0,K+1){
      if(v + j*(b/i) > b){
        break;
      }
      if(k - j < 0){
        break;
      }
      p *= com[k][j];
      k -= j;
      v += j*(b/i);
      f(i+1);
      v -= j*(b/i);
      k += j;
      p /= com[k][j];
    }
    return;
  };
  f(1);
  cout << ans << '\n';
}