#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
 
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 1] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}

#define print(a) cout << a << endl;
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;}
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define pb push_back
#define fi first
#define se second
#define vi vector <int>
#define pi pair <int, int>
#define vpi vector <pi>
#define vvi vector <vi>
#define setprec cout << fixed << showpoint << setprecision(20);
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 998244353;
const ll N = 2e5 + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int power (int a, int b = mod - 2)
{
    int res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

int dp[3001][3001] = {}, sum[3001][6001] = {};
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	dp[0][0] = sum[0][0] = 1;
	readb(n, k);
	FOR (i, 1, n)
	{
	    FORD (j, 2*n, n + 1) sum[i][j] = sum[i - 1][j - 2];
	    FORD (j, n, 1)
	    {
	        dp[i][j] = sum[i][2*j];
	        if (j >= 2) sum[i][j] = (dp[i][j] + sum[i - 1][j - 2]) % mod;
	        else sum[i][j] = dp[i][j];
	    }
	}
	
    print(dp[n][k]);
}


















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

template <typename T>
int len(const T& a) {
	return a.size();
}
using ll = long long;

const int MOD = 998244353;

void Ok(int& a) {
	if (a >= MOD)
		a -= MOD;
}

const int N = 3010;

int n, k;
int dp[N][N << 1];

int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	scanf("%d%d", &n, &k);
	dp[0][0] = 1; // empty set
	for (int i = 1; i <= n; ++i) { // size of set
		for (int j = n; j >= 1; --j) {
			Ok(dp[i][j] = dp[i - 1][j - 1] + dp[i][j << 1]);
		}
	}
	printf("%d", dp[n][k]);
	return 0;
}

