#include<iostream>
#include<cstdio>
#define N 60
#define mod 998244353
using namespace std;
long long read()
{
	char c=0;
	long long sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int n,ans,dp[N+1][N+1],F[N+1],G[N+1],pw2[N+1],inv[N+1],C[N+1][N+1],S[N+1][N+1],S2[N+1][N+1];
long long c;
int main()
{
	pw2[0]=1;
	for (int i=1;i<=N;++i) pw2[i]=2ll*pw2[i-1]%mod;
	inv[1]=1;
	for (int i=2;i<=N;++i) inv[i]=MD2(-1ll*(mod/i)*inv[mod%i]%mod);
	for (int i=0;i<=N;++i) C[i][0]=1;
	for (int i=1;i<=N;++i)
		for (int j=1;j<=i;++j)
			C[i][j]=MD(C[i-1][j-1]+C[i-1][j]);
	S[0][0]=S2[0][0]=1;
	for (int i=1;i<=N;++i)
		for (int j=1;j<=i;++j)
			S[i][j]=MD(S[i-1][j-1]+1ll*S[i-1][j]*(i-1)%mod),S2[i][j]=MD(S2[i-1][j-1]+1ll*S2[i-1][j]*j%mod);
	n=read(),c=read()-(1ll<<(n-1));
	if (c<0)
	{
		puts("0");
		return 0;
	}
	dp[0][0]=dp[0][1]=1;
	for (int i=1;i<=n-1;++i)
	{
		for (int j=0;j<=i;++j) F[j]=G[j]=0;
		if ((c>>(i-1))&1)
		{
			for (int j=0;j<=i;++j)
				for (int k=0;k<=j;++k)
					Adder(F[k],1ll*dp[i-1][j]*C[j][k]%mod*pw2[k]%mod);
		}
		else
		{
			for (int j=0;j<=i;++j) F[j]=1ll*dp[i-1][j]*pw2[j]%mod;
		}
		for (int j=0;j<=i;++j)
			for (int k=0;k<=j;++k)
				Adder(G[k],1ll*F[j]*S2[j][k]%mod);
		for (int j=i+1;j>=1;--j) Adder(G[j],1ll*G[j-1]*inv[j]%mod);
		for (int j=0;j<=i+1;++j)
			for (int k=0;k<=j;++k)
			{
				if (!((j-k)&1)) Adder(dp[i][k],1ll*G[j]*S[j][k]%mod);
				else Adder2(dp[i][k],-1ll*G[j]*S[j][k]%mod);
			}
	}
	c/=(1ll<<(n-1));
	for (int i=0,res=1;i<=n;++i,res=1ll*res*(c%mod)%mod) Adder(ans,1ll*dp[n-1][i]*res%mod);
	printf("%d\n",ans);
	return 0;
}