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

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

using mint = atcoder::modint998244353;

int main(){
	vector<vector<mint>> dp = {vector<mint>{1}, vector<mint>{0}, vector<mint>{0}};
	int n, k;
	cin >> n >> k;
	
	vector<vector<mint>> ep = {vector<mint>{1}, vector<mint>{0}, vector<mint>{0}};
	
	for(int x = 1; x <= n; x++){
		vector<vector<mint>> dp_old(3, vector<mint>(2 * x + 1, 0));
		swap(dp, dp_old);
		vector<vector<mint>> ep_old(3, vector<mint>(2 * x + 1, 0));
		swap(ep, ep_old);
		if(x % 2){
			for(int i = 0; i <= 2 * (x - 1); i++) dp[0][i] += dp_old[0][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[1][i] += dp_old[0][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[2][i] += dp_old[0][i];
			
			for(int i = 0; i <= 2 * (x - 1); i++) dp[0][i + 1] += dp_old[1][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[1][i + 1] += dp_old[1][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[2][i + 1] += dp_old[1][i];
			
			for(int i = 0; i <= 2 * (x - 1); i++) dp[0][i + 1] += dp_old[2][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[1][i + 1] += dp_old[2][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[2][i + 1] += dp_old[2][i];
		}else{
			for(int i = 0; i <= 2 * (x - 1); i++) dp[0][i + 1] += dp_old[0][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[1][i + 1] += dp_old[0][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[2][i + 1] += dp_old[0][i];
			
			for(int i = 0; i <= 2 * (x - 1); i++) dp[0][i + 1] += dp_old[1][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[1][i + 1] += dp_old[1][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[2][i + 1] += dp_old[1][i];
			
			for(int i = 0; i <= 2 * (x - 1); i++) dp[0][i] += dp_old[2][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[1][i] += dp_old[2][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[2][i] += dp_old[2][i];
		}
		{
			for(int i = 0; i <= 2 * (x - 1); i++) dp[2][i] += ep_old[0][i] - dp_old[0][i];
			for(int i = 0; i <= 2 * (x - 1); i++) dp[0][i] += ep_old[2][i] - dp_old[2][i];
		}
		{
			for(int i = 0; i <= 2 * (x - 1); i++) ep[0][i + 2] += ep_old[0][i];
			for(int i = 0; i <= 2 * (x - 1); i++) ep[1][i + 2] += ep_old[1][i];
			for(int i = 0; i <= 2 * (x - 1); i++) ep[2][i + 2] += ep_old[2][i];
			
			for(int i = 0; i <= 2 * x; i++) ep[0][i] += dp[0][i];
			for(int i = 0; i <= 2 * x; i++) ep[1][i] += dp[1][i];
			for(int i = 0; i <= 2 * x; i++) ep[2][i] += dp[2][i];
		}
	}
	mint ans = 0;
	if(n % 2){
		for(int i = 0; i <= k; i++) ans += dp[2][i];
	}else{
		for(int i = 0; i <= k; i++) ans += dp[0][i];
	}
	cout << ans << "\n";
	
	
	return 0;
}