#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

const int MAX=31,MOD=998244353;
vector<ll>fac(MAX),finv(MAX),inv(MAX);

void set_fac(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    for (int i=2;i<MAX;i++){
        fac[i]=fac[i-1]*i%MOD;
        inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
        finv[i]=finv[i-1]*inv[i]%MOD;
    }
}

ll cmb(int n,int r){
    if (r<0||n<r)return 0;
    return fac[n]*(finv[r]*finv[n-r]%MOD)%MOD;
}

int n,m;
ll dp[31][31][2];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    set_fac();
    cin>>n>>m;
    dp[30][0][0]=1;
    rrep(i,30){
        if(m>>i&1){
            rep(j,31){
                if(j+1<=30){
                    dp[i][j+1][0]+=dp[i+1][j][0];
                    dp[i][j+1][1]+=dp[i+1][j][1];
                }
                dp[i][j][1]+=dp[i+1][j][1]+dp[i+1][j][0];
            }
        }else{
            rep(j,30){
                if(j+1<=30){
                    dp[i][j+1][1]+=dp[i+1][j][1];
                }
                dp[i][j][1]+=dp[i+1][j][1];
                dp[i][j][0]+=dp[i+1][j][0];
            }
        }
    }
    ll ans=0;
    vector<vector<ll>>A(n,vector<ll>(31));
    rep(i,31)A[0][i]=1;
    rep(i,n-1){
        rep(j,31){
            rep2(l,j,31){
                A[i+1][l]+=cmb(l,j)*A[i][j];
                A[i+1][l]%=MOD;
            }
        }
    }
    rep(k,31){
        ll a=dp[0][k][0]+dp[0][k][1];
        ans+=a*A[n-1][k];
        ans%=MOD;
    }
    cout<<ans<<"\n";
}