#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
const int mod=998244353;
int fac[2000005],ifac[2000005];
int qkp(int n,int m){
	int res=1;
	while(m){
		if(m&1)(res*=n)%=mod;
		m/=2;
		(n*=n)%=mod;
	}
	return res;
}
int C(int n,int m){
	if(n<0||m<0||n<m)return 0;
	return fac[n]*ifac[n-m]%mod*ifac[m]%mod;
}
int dp[2005][2005];
int pw[2000005];
int n,m;
signed main(){
	fac[0]=1;pw[0]=1;
	for(int i=1;i<=2000000;i++)pw[i]=pw[i-1]*2%mod,fac[i]=fac[i-1]*i%mod;
	ifac[2000000]=qkp(fac[2000000],mod-2);
	for(int i=1999999;i>=0;i--){
		ifac[i]=ifac[i+1]*(i+1)%mod;
	}
	n=read(),m=read();
	dp[0][0]=1;
	int l=2*n;
	//3 6
	//1 4 7
	//2 5 8
	//3 4
	//6 _
	//7 _
	//1 _
	for(int i=1;i<=m;i++){
		int cnt=0;
		for(int j=1;j<=2*n;j++)cnt+=((j%m)==i-1);
		for(int j=(l&1);j<=min(n,l);j+=2){
			if(!dp[i-1][j])continue;
			//把 cnt 个数放入.
			int x=(l-j)/2;
			for(int y=0;y<=j;y++){
				if(y>cnt)continue;
				int p=(cnt-y);
				if(p>x)continue;
				//放 y 个只有 1 对的.
				if(j-y+p<0)continue;
				dp[i][j-y+p]+=dp[i-1][j]*C(x,p)%mod*pw[p]%mod*C(j,y)%mod*fac[p]%mod*fac[y]%mod*C(cnt,y)%mod;
				//cout<<i<<" "<<j<<" "<<y<<" "<<p<<" "<<dp[i-1][j]*C(x,p)%mod*pw[p]%mod*C(j,y)%mod*fac[p]%mod*fac[y]%mod<<"\n";
				dp[i][j-y+p]%=mod;
			}
		}
		l-=cnt;
		//mod m=i-1
		//
	}
	cout<<dp[m][0]<<"\n";
	return 0;
}