#include <stdio.h>

const int Mod = 998244353;
long long fact[31], fact_inv[31];

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long combination(int n, int k)
{
	if (k < 0 || n < k) return 0;
	return fact[n] * fact_inv[k] % Mod * fact_inv[n-k] % Mod;
}

int main()
{
	int N, M;
	scanf("%d %d", &N, &M);
	
	int i, bit[31];
	for (i = 1, bit[0] = 1; i <= 30; i++) bit[i] = bit[i-1] << 1;
	for (i = 1, fact[0] = 1; i <= 30; i++) fact[i] = fact[i-1] * i % Mod;
	for (i = 29, fact_inv[30] = div_mod(1, fact[30], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;

	int j, k, cur, prev;
	long long dp[2][31] = {};
	for (i = 30, k = 0, dp[0][0] = 1; i >= 0; i--) {
		if ((M & bit[i]) == 0) continue;
		for (j = 1; j <= i; j++) dp[0][j+k] += combination(i, j);
		dp[0][++k]++;
	}
	for (i = 1, cur = 1, prev = 0; i < N; i++, cur ^= 1, prev ^= 1) {
		for (j = 0; j <= 30; j++) {
			for (k = j, dp[cur][j] = 0; k <= 30; k++) dp[cur][j] += dp[prev][k] * combination(k, j) % Mod;
			dp[cur][j] %= Mod;
		}
	}
	
	long long ans = 0;
	for (j = 0; j <= 30; j++) ans += dp[prev][j];
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}