//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=998244353;
using matrix=vector<vector<ll>>;
matrix mul(matrix a,matrix b)
{
	int n=sz(a);
	matrix ret(n,vector<ll>(n));
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			for(int k=0;k<n;k++)
				ret[i][k]=(ret[i][k]+a[i][j]*b[j][k])%mod;
	return ret;
}
int n,m;
ll dp[33][2];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	ll ways=0;
	matrix M(4,vector<ll>(4));
	for(int a=0;a<4;a++)
		for(int b=0;b<4;b++) if((a&1)==(b>>1)) if(((a&1)+((b&1)&(a>>1)))==1)
			M[a][b]=1;
	matrix ans(4,vector<ll>(4));
	for(int i=0;i<4;i++)
		ans[i][i]=1;
	while(n)
	{
		if(n&1) ans=mul(ans,M);
		M=mul(M,M);
		n>>=1;
	}
	for(int i=0;i<4;i++)
		ways=(ways+ans[i][i])%mod;
	dp[0][0]=1;
	for(int i=0;i<30;i++)
		for(int a=0;a<2;a++)
		{
			if(a==(m>>i&1))
			{
				dp[i+1][0]=(dp[i+1][0]+dp[i][a])%mod;
				dp[i+1][1]=(dp[i+1][1]+dp[i][a])%mod;
			}
			else
			{
				dp[i+1][a]=(dp[i+1][a]+dp[i][a]*ways)%mod;
			}
		}
	cout<<dp[30][0]<<'\n';
	return 0;
}