#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

#define N 3010
#define MOD 998244353
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = a; i <= b; ++i)
#define rep3(i, a, b) for(int i = a; i >= b; --i)
#define eb emplace_back
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>



int main() {
	int n, k;
	int x;
	ll dp[N][N];
	ll s[2 * N];
	rep(i, N) {
		rep(j, N) {
			dp[i][j] = 0;
		}
	}
	rep(i, 2 * N)s[i] = 0;
  dp[0][0]=1;
  s[0]=1;
	cin >> n >> k;
	rep2(i, 1, n) {
		rep3(j, i, 1) {
			x = (2 * i) - (2 * j);
			dp[i][j] = s[x];
			x = (2 * i) - j;
			s[x] = (s[x] + dp[i][j]) % MOD;
		}
	}
	cout << dp[n][k] << endl;



	return 0;
}

#include <bits/stdc++.h>

#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a,v) memset((a), v, sizeof(a))

using namespace std;

typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

const int N = 3002;
const int MOD = 998244353;

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

void fillDP() {
	dp[0][0] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = i; j > 0; j--) {
			dp[i][j] = (dp[i-1][j-1] + dp[i][min(N-1, 2*j)]) % MOD;
		}
	}
}

int main() {
	scanf("%d %d", &n, &k);
	fillDP();
	printf("%d\n", dp[n][k]);
	return 0;
}