#include<bits/stdc++.h>
using namespace std;
#include <unordered_set>
#include <random>
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll inv2=499122177;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

ll dx[]={0,1,0,-1,-1,-1,1,1};
ll dy[]={1,0,-1,0,-1,1,-1,1};

string u="RDLU";

//Combination
long long extGCD(long long a,long long mod,long long &x,long long &y){
    if(mod==0){
        x=1;
        y=0;
        return a;
    }
    long long d=extGCD(mod,a%mod,y,x);
    y-=(a/mod)*x;
    return d;
}
long long invmod(long long a,long long mod){
    long long x,y;
    extGCD(a,mod,x,y);
    x%=mod;
    if(x<0)x+=mod;
    return x;
}
ll fac[MAX],finv[MAX],inv[MAX];
void combinit(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    REP(i,2,MAX){
        fac[i]=fac[i-1]*i%mod;
        inv[i]=invmod(i,mod);
        finv[i]=finv[i-1]*inv[i]%mod;
    }
}
ll comb(ll n,ll k){
    if(n<k)return 0;
    if(n<0||k<0)return 0;
    return fac[n]*(finv[k]*finv[n-k]%mod)%mod;
}

void solve(){
    combinit();
    ll N,M;cin>>N>>M;
    //M以下で　k bit のものはいくつあるか
    vector<ll>cnt(31);
    ll now=0;
    for(int i=29;i>=0;i--){
        if((1<<i)&M){
            rep(j,i+1){
                cnt[now+j]+=comb(i,j);
                cnt[now+j]%=mod;
            }
            now++;
        }
    }
    cnt[now]++;
    vector<vector<ll> >dp(N,vector<ll>(31));
    rep(i,31)dp[0][i]=cnt[i];
    rep(i,N-1){
        rep(j,31){
            rep(k,j+1){
                dp[i+1][k]=(dp[i+1][k]+dp[i][j]*comb(j,k)%mod)%mod;
            }
        }
    }
    ll ans=0;
    rep(i,31){
        ans+=dp[N-1][i];
        ans%=mod;
    }
    if(ans<0)ans+=mod;
    cout<<ans<<endl;
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}