#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using mint = atcoder::modint998244353;

// combination MOD
const int MOD=998244353;
const int MAX_N=2e6;
vector<ll> fac(MAX_N+1,1);
vector<ll> finv(MAX_N+1,1);
vector<ll> inv(MAX_N+1,1);
void comb_setup(){
	for(int i=2;i<=MAX_N;i++){
		fac.at(i)=(fac.at(i-1)*i)%MOD;
		inv.at(i)=MOD-(inv.at(MOD%i)*(MOD/i))%MOD;
		finv.at(i)=(finv.at(i-1)*inv.at(i))%MOD;
	}
}
ll comb(int n,int k){
	if(n<k) return 0;
	return fac.at(n)*(finv.at(n-k)*finv.at(k)%MOD)%MOD;
}

int main(){
	comb_setup();
	int n,k;
	cin>>n>>k;
	if(n==1){
		int ans=0;
		if(k==0) ans=1;
		if(k==1) ans=1;
		if(k==2) ans=3;
		if(k==3) ans=3;
		if(k==4) ans=3;
		if(k==5) ans=1;
		if(k==6) ans=1;
		cout<<ans<<endl;
		return 0;
	}
	mint ans=comb(2*n+4,k);
	if(n%2){
		if(k%2) ans+=comb(n+1,(k-1)/2)*2;
		else{
			ans+=comb(n+1,k/2);
			ans+=comb(n+1,(k-2)/2);
		}
	}else{
		if(!(k%2)) ans+=comb(n+2,k/2);
	}
	if(!(k%2)){
		ans+=comb(n+2,k/2)*2;
	}
	ans/=4;
	cout<<ans.val()<<endl;
}