#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
using mint = modint998244353;
constexpr int MAX = 3e5;
constexpr int BMAX = 31;
mint fac[MAX], finv[MAX];

void combinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  for (int i = 2; i < MAX; i++){
    fac[i] = fac[i-1] * mint(i);
    finv[i] = finv[i-1] * mint(i).inv();
  }
}

mint comb(int n, int k){
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * finv[k] * finv[n-k];
}

int main(){
  int n, m;
  cin >> n >> m;
  combinit();
  vector<vector<mint>> dp(BMAX,vector<mint>(2));
  dp[0][0] = 1;
  for(int i = BMAX-1; i >= 0; i--) {
    vector<vector<mint>> dpn(BMAX,vector<mint>(2));
    rep(j,BMAX) {
      if(j+1 < BMAX) dpn[j+1][1] += dp[j][1];
      dpn[j][1] += dp[j][1]; 
      if((1<<i) & m) {
        if(j+1 < BMAX) dpn[j+1][0] += dp[j][0];
        dpn[j][1] += dp[j][0];
      } else {
        dpn[j][0] += dp[j][0];
      }
    }
    swap(dp,dpn);
  }
  mint ans = 0;
  vector<mint> dp2(BMAX);
  rep(i,BMAX) rep(j,2) dp2[i] += dp[i][j];
  rep(i,n-1) {
    vector<mint> dp2n(BMAX);
    rep(j,BMAX) rep(k,j+1) dp2n[k] += dp2[j]*comb(j,k);
    swap(dp2,dp2n);
  }
  rep(i,BMAX) ans += dp2[i];
  cout << ans.val() << endl;
  return 0;
}