/**
	author:  shobonvip
	created: 2025.04.06 17:27:00
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n,k;cin>>n>>k;
	vector dp(n, vector(3, vector<mint>(2*n)));
	dp[0][0][0] = 1;
	dp[0][1][0] = 1;
	dp[0][2][0] = 1;
	rep(l,1,n){
		dp[l][2][2*l] += 1;
	}
	// 0 -> 0
	// 0 -> 1
	// 0 -> 2
	// 1 -> 0
	// 1 -> 1
	// 1 -> 2
	// 2 -> 0
	// 2 -> 1
	// 2 -> 2
	// JUMP! 0 -> 2
	// JUMP! 2 -> 0
	rep(i,0,n-1){
		rep(j,0,2*n){
			if(dp[i][0][j].val()==0)continue;
			dp[i+1][0][j+((i&1)^1)] += dp[i][0][j];
			dp[i+1][1][j+((i&1)^1)] += dp[i][0][j];
			dp[i+1][2][j+((i&1)^1)] += dp[i][0][j];
		}
		rep(j,0,2*n){
			if(dp[i][1][j].val()==0)continue;
			dp[i+1][0][j+1] += dp[i][1][j];
			dp[i+1][1][j+1] += dp[i][1][j];
			dp[i+1][2][j+1] += dp[i][1][j];
		}
		rep(j,0,2*n){
			if(dp[i][2][j].val()==0)continue;
			dp[i+1][0][j+(i&1)] += dp[i][2][j];
			dp[i+1][1][j+(i&1)] += dp[i][2][j];
			dp[i+1][2][j+(i&1)] += dp[i][2][j];
		}
		rep(j,0,2*n){
			rep(l,i+2,n){
				if(dp[i][2][j].val()==0)continue;
				dp[l][0][j+(i&1)+2*(l-i-1)] += dp[i][2][j];
			}
		}
		rep(j,0,2*n){
			rep(l,i+2,n){
				if(dp[i][0][j].val()==0)continue;
				dp[l][2][j+((i&1)^1)+2*(l-i-1)] += dp[i][0][j];
			}
		}
	}

	mint ans=0;
	rep(i,0,k+1){
		ans+=dp[n-1][(n%2==1?2:0)][i];
	}
	cout<<ans.val()<<endl;



}