#include<iostream>
#include<cstdio>
#include<vector>
#define N 100000
#define M 262144
#define K 20
#define g 3
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
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 MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
int n,d,ans,length,cl[6][6],A[M+1],B[M+1],wn[K+1][M+1],wn2[K+1][M+1],rev[M+1],num[M+1];
struct matrix
{
	vector<int>p[6][6];
};
matrix e,nw,dres,c,zero;
vector<int>zro;
void NTT(int limit,int *s,int type)
{
	int s1,s2;
	for (int i=1;i<limit;++i) rev[i]=(rev[i>>1]>>1)|((i&1)?(limit>>1):0);
	for (int i=0;i<limit;++i)
		if (rev[i]>i)
			swap(s[i],s[rev[i]]);
	if (type==1)
	{
		for (int i=2;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<j+(i>>1);++k)
					s1=s[k],s2=1ll*s[k+(i>>1)]*wn[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
	}
	else
	{
		for (int i=2;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<j+(i>>1);++k)
					s1=s[k],s2=1ll*s[k+(i>>1)]*wn2[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
		s1=fast_pow(limit,mod-2);
		for (int i=0;i<limit;++i) s[i]=1ll*s[i]*s1%mod;
	}
	return;
}
vector<int>operator + (vector<int>a,vector<int>b)
{
	if (a.size()<b.size()) swap(a,b);
	for (int i=0;i<b.size();++i) Adder(a[i],b[i]);
	return a;
}
vector<int>operator * (vector<int>a,vector<int>b)
{
	if (a.empty()||b.empty()) return zro;
	int limit=1;
	vector<int>cs(min((int)(a.size()+b.size()-1),d));
	if (min(a.size(),b.size())<=10)
	{
		for (int i=0;i<a.size();++i)
			for (int j=0;j<b.size()&&i+j<cs.size();++j)
				Adder(cs[i+j],1ll*a[i]*b[j]%mod);
		return cs;
	}
	else
	{
		while (limit<=a.size()+b.size()) limit<<=1;
		for (int i=0;i<=limit;++i) A[i]=B[i]=0;
		for (int i=0;i<a.size();++i) A[i]=a[i];
		for (int i=0;i<b.size();++i) B[i]=b[i];
		NTT(limit,A,1),NTT(limit,B,1);
		for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*B[i]%mod;
		NTT(limit,A,-1);
		for (int i=0;i<cs.size();++i) cs[i]=A[i];
	}
	return cs;
}
matrix operator * (matrix a,matrix b)
{
	c=zero;
	for (int k=0;k<6;++k)
		for (int i=0;i<6;++i)
			for (int j=0;j<6;++j)
				c.p[i][j]=c.p[i][j]+a.p[i][k]*b.p[k][j];
	return c;
}
matrix fast_pows(matrix a,int b)
{
	matrix res=e,mul=a;
	while (b)
	{
		if (b&1) res=res*mul;
		mul=mul*mul,b>>=1;
	}
	return res;
}
int main()
{
	int rst;
	for (int i=2;i<=M;i<<=1)
	{
		num[i]=++length,rst=fast_pow(g,(mod-1)/i);
		for (int j=0,res=1;j<(i>>1);++j,res=1ll*res*rst%mod) wn[num[i]][j]=res;
		rst=fast_pow(g,(mod-1)/i*(i-1));
		for (int j=0,res=1;j<(i>>1);++j,res=1ll*res*rst%mod) wn2[num[i]][j]=res;
	}
	for (int i=0;i<6;++i) e.p[i][i]={1};
	n=read(),d=read();
	for (int op=0;op<=1;++op)
		for (int op2=0;op2<=1;++op2)
			for (int op3=0;op3<=1-op;++op3)
				for (int op4=0;op4<=1-op2;++op4)
					nw.p[(op<<1)+op2][(op3<<1)+op4].resize((!op&&!op3)+(!op2&&!op4)+1),nw.p[(op<<1)+op2][(op3<<1)+op4].back()=1;
	nw.p[1][4]=nw.p[4][4]=nw.p[4][5]=nw.p[5][4]={1},dres=fast_pows(nw,n);
	for (int i=0;i<=3;++i)
		if (d-1<dres.p[i][4].size())
			Adder(ans,dres.p[i][4][d-1]);
	printf("%d\n",ans);
	return 0;
}