#include <iostream>
using ll = long long;
using namespace std;

int main() {
	int N, K;
	cin >> N >> K;
	ll dpUpper[5005][5005] = { 0 };
	ll dpLower[5005][5005] = { 0 };
	for (int i = 0;i <= K;i++) {
		dpUpper[i][0] = 1;
	}
	for (int j = 1;j <= N;j++) {
		dpUpper[j][j] = dpUpper[j][j - 1];
		for (int i = j + 1;i - j <= K && i <= N;i++) {
			dpUpper[i][j] = (dpUpper[i][j - 1] + dpUpper[i - 1][j]) % 998244353;
		}
	}
	for (int i = 0;i <= K - 1;i++) {
		dpLower[i][0] = 1;
	}
	for (int j = 1;j <= N;j++) {
		dpLower[j][j] = dpLower[j][j - 1];
		for (int i = j + 1;i - j <= K - 1 && i <= N;i++) {
			dpLower[i][j] = (dpLower[i][j - 1] + dpLower[i - 1][j]) % 998244353;
		}
	}
	cout << (dpUpper[N][N] - dpLower[N][N] + 998244353) % 998244353;
	return 0;
}