#include <bits/stdc++.h>

const int mod = 998244353;

inline int inc(int x, int y) { x += y - mod; return x + (x >> 31 & mod); }
inline int dec(int x, int y) { x -= y; return x + (x >> 31 & mod); }
inline void upd(int &x, int y) { x = inc(x, y); }

int main() {
	int n, k;
	std::cin >> n >> k;
	const int U = 1 << (1 << k);
	int full = (1 << k) - 1;
	int ans = 0;
	auto solve = [&](int mask) {
		int m = 1 << k;
		std::vector<int> a(m);
		for (int i = 0; i < m; ++i)
			a[i] = (mask >> i & 1);
		for (int i = 0; i + k <= m; ++i) {
			int u = 0;
			for (int j = i; j < i + k; ++j)
				u = u * 2 + a[j];
			if (a[u] == 0) return 0;
		}
		int init_v = 0;
		for (int i = m - k; i < m; ++i)
			init_v = init_v * 2 + a[i];
		std::vector<std::vector<int>> dp(n + 1, std::vector<int>(m));
		dp[m - 1][init_v] = 1;
		for (int i = m; i < n; ++i) {
			for (int v = 0; v < m; ++v) {
				for (int bit : {0, 1}) {
					int nv = (v * 2 + bit) & full;
					if (a[nv] == 1) {
						upd(dp[i][nv], dp[i - 1][v]);
					}
				}
			}
		}
		int ans = 0;
		for (int i = 0; i < m; ++i)
			upd(ans, dp[n - 1][i]);
		return ans;
	};
	for (int mask = 0; mask < U; ++mask) {
		upd(ans, solve(mask));
	}
	std::cout << ans << '\n';
}