#include <bits/stdc++.h>

using namespace std;

#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef pair<long long, long long> P;

const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; i++){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

struct Combination{
    vector<long long> memo;
    vector<long long> memoinv;
    long long mod;

    Combination(int N, long long m) : memo(N+1), memoinv(N+1){
        mod = m;
        memo[0] = 1;
        for(int i = 1; i <= N; i++){
            memo[i] = memo[i-1] * i;
            memo[i] %= mod;
        }
        memoinv[0] = inv(1LL, mod);
        for(int i = 1; i <= N; i++){
            memoinv[i] = inv(1LL * memo[i], mod);
            memoinv[i] %= mod;
        }
    }

    long long inv(long long a, long long m){
        long long b = m, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        u %= m;
        if (u < 0) u += m;
        return u;
    }

    long long fact(long long n){
        return memo[n];
    }

    long long factinv(long long n){
        return memoinv[n];
    }

    long long ncr(long long n, long long r){
        if(n < r || r < 0) return 0;
        return (memo[n] * memoinv[r] % mod) * memoinv[n - r] % mod;
    }

    long long npr(long long n, long long r){
        if(n < r || r < 0) return 0;
        return (memo[n] % mod) * memoinv[n - r] % mod;
    }
};

ll n, m;

ll dp[202020][33];
ll dp2[33][2][33];

void input(){
    in(n, m);
}
 
void solve(){
    dp2[0][1][0] = 1;
    ll mx = 0;
    for(ll i = 0; 1 << i <= m; i++){
        chmax(mx, i);
    }
    for(int i = 0; i <= mx; i++){
        for(int k = 0; k <= 30; k++){
            for(int l = 0; l <= 1; l++){
                int cnt = k + l;
                dp2[i+1][0][cnt] += dp2[i][0][k];
            }
            for(int l = 0; l <= ((m >> (mx - i)) & 1); l++){
                int cnt = k + l;
                int b = 0;
                if(l == ((m >> (mx - i)) & 1)) b = 1;
                dp2[i+1][b][cnt] += dp2[i][1][k];
            }
        }
    }
    Combination C(33, MOD);
    for(int j = 0; j <= 30; j++){
        dp[0][j] = dp2[mx + 1][0][j] + dp2[mx + 1][1][j];
        //out(dp[0][j]);
    }
    for(int i = 0; i < n - 1; i++){
        for(int j = 0; j <= 30; j++){
            for(int k = 0; k <= j; k++){
                dp[i + 1][k] += dp[i][j] * C.ncr(j, k);
                dp[i + 1][k] %= MOD;
            }
        }
    }
    ll ans = 0;
    for(int j = 0; j <= 30; j++){
        ans += dp[n - 1][j];
        ans %= MOD;
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    input();
    solve();
}