#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=5e5;
const int mod=998244353;
using arr=int[N+5];
arr fac,ifac;
int ksm(ll x,int tp,int s=1){
	for(;tp;x=x*x%mod,tp>>=1) if(tp&1) s=x*s%mod;
	return s;
}
void prep(int n){
	fac[0]=1;
	for(int i=1;i<=n;i++) fac[i]=1ll*fac[i-1]*i%mod;
	ifac[n]=ksm(fac[n],mod-2);
	for(int i=n;i;i--) ifac[i-1]=1ll*ifac[i]*i%mod;
}
int C(int n,int m){ return n<0||m<0||n<m?0:1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod; }
int inv(int n){ return 1ll*ifac[n]*fac[n-1]%mod; }
int n,p,m,r;
arr f;
int ans;
int main(){
	scanf("%d %d",&n,&p);
	m=(3*n+1)/4; r=n-m-1-7*p;
	if(n%4!=1||r<0){
		puts("0"); return 0;
	}
	if(n==1){
		puts("1"); return 0;
	}
	prep(n);
	ans=1ll*C(n,m)*C(m,p)%mod*fac[m-1]%mod*fac[n-m-1]%mod;
	ans=ksm(ifac[3],n-m,ans);
	ans=ksm(ifac[7],p,ans);
	f[0]=1;
	for(int i=1;i<=r;i++){
		ll s=0;
		for(int j=1;j<7&&j<=i;j++)
			s+=1ll*ifac[j-1]*f[i-j];
		s=s%mod*(m-p+1)%mod*inv(i)%mod;
		for(int j=1;j<7&&j<=i;j++)
			s-=1ll*ifac[j]*f[i-j];
		f[i]=s%mod;
	}
	printf("%lld\n",1ll*ans*(f[r]+mod)%mod);
	return 0;
}