#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

mint dp[200005][31];

mint get(int N,int cur){
	int cnt = 0;
	rep(j,30){
		if((cur>>j)&1)cnt++;
	}
	return dp[N][cur];
}

int main() {
	
	long long N,M;
	cin>>N>>M;
	
	combi C(400000);
	rep(i,31)dp[0][i] = 1;
	
	rep(i,200003){
		rep(j,31){
			rep(k,31){
				if(j+k>30)break;
				dp[i+1][j+k] += dp[i][j] * C.junretsu(j,k);
			}
		}
	}
	
	mint ans = 0;
	ans += dp[N-1][__builtin_popcount(M)];
	int x = 0;
	for(int i=29;i>=0;i--){
		if((M>>i)&1){
			int y = i;
			rep(k,y+1){
				ans += dp[N-1][x+k] * C.combination(y,k);
			}
			
			x++;
		}
	}
	cout<<ans.val()<<endl;
    return 0;
}