#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		if(r<0)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

combi C(1000000);

vector<int> get(vector<int> t){
	vector<int> ret = t;
	rep(i,2){
		rep(j,10){
			t.push_back(t[0]);
			t.erase(t.begin());
			ret = min(ret,t);
		}
		reverse(t.begin(),t.end());
	}
	return ret;
}

int main(){
	
	int N,K;
	cin>>N>>K;
	
	if(N==1){
		set<vector<int>> S;
		rep(i,1<<6){
			if(__builtin_popcount(i)!=K)continue;
			vector<int> t(6);
			rep(j,6)t[j] = (i>>j)&1;
			S.insert(get(t));
		}
		cout<<S.size()<<endl;
	}
	else{
		mint ans = 0;
		//不動
		ans += C.combination(2*N+4,K);
		//上下
		if(K%2==0)ans += C.combination(N+2,K/2);
		//左右
		if(N%2==1){
			rep(i,2){
				rep(j,2){
					int k = K-i-j;
					if(k%2==1)continue;
					k /= 2;
					rep(l,N/2+2){
						ans += C.combination(N/2+1,l) * C.combination(N/2+1,k-l);
					}
				}
			}
		}
		else{
			int k = K;
			if(k%2==0){
				k /= 2;
				rep(l,N/2+2){
					ans += C.combination(N/2+1,l) * C.combination(N/2+1,k-l);
				}
			}
		}
		
		//上下左右
		if(K%2==0)ans += C.combination(N+2,K/2);
		
		ans /= 4;
		cout<<ans.val()<<endl;
	}
	
	return 0;
}