#include <bits/stdc++.h>
#define MOD 998244353

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}
int main() {
	int n = ri();
	int k = ri();
	int kk = k * k;
	int kkk = k * k * k;
	int a[kkk][kkk];
	memset(a, 0, sizeof(a));
	for (int i = 0; i < k*k*k; i++) {
		int x = i / kk;
		int y = i / k % k;
		int z = i % k;
		a[i][x * kk + y * k + (z + 1) % k]++;
		a[i][x * kk + (y + z) % k * k + z]++;
		a[i][(x + y) % k * kk + y * k + z]++;
	}
	std::vector<int> res(kkk, 0);
	std::vector<int> tmp(kkk);
	res[0] = 1;
	while (n) {
		if (n & 1) {
			tmp.assign(kkk, 0);
			for (int i = 0; i < kkk; i++)
				for (int j = 0; j < kkk; j++) {
					tmp[j] += (int64_t) res[i] * a[i][j] % MOD;
					if (tmp[j] >= MOD) tmp[j] -= MOD;
				}
			std::swap(tmp, res);
		}
		int b[kkk][kkk];
		memset(b, 0, sizeof(b));
		for (int i = 0; i < kkk; i++) {
			for (int j = 0; j < kkk; j++) {
				for (int l = 0; l < kkk; l++) {
					b[i][j] += (int64_t) a[i][l] * a[l][j] % MOD;
					if (b[i][j] >= MOD) b[i][j] -= MOD;
				}
			}
		}
		memcpy(a, b, sizeof(a));
		n /= 2;
	}
	int ans = 0;
	for (int i = 0; i < kk; i++) {
		ans += res[i];
		if (ans >= MOD) ans -= MOD;
	}
	std::cout << ans << std::endl;
	return 0;
}