import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int K = sc.nextInt();

		long[][] a = new long[K * K * K][K * K * K];
		for (int i = 0; i < K; ++i) {// ほ
			for (int j = 0; j < K; ++j) {// ほむ
				for (int k = 0; k < K; ++k) {// ほむら
					int src = i + j * K + k * K * K;

					// ほ
					a[(i + 1) % K + j * K + k * K * K][src]++;

					// む
					a[i + (j + i) % K * K + k * K * K][src]++;

					// ら
					a[i + j * K + (k + j) % K * K * K][src]++;
				}
			}
		}

		long[][] v = new long[K * K * K][1];
		v[0][0] = 1;
		v = mul(pow(a, N), v);
		long ans = 0;
		for (int i = 0; i < K; ++i) {
			for (int j = 0; j < K; ++j) {
				ans += v[i + j * K][0];
				ans %= MOD;
			}
		}
		System.out.println(ans);
	}

	final long MOD = 998244353;

	long[][] pow(long[][] a, long n) {
		long[][] ret = new long[a.length][a.length];
		for (int i = 0; i < a.length; ++i)
			ret[i][i] = 1;
		for (; n > 0; n >>= 1, a = mul(a, a)) {
			if (n % 2 == 1) {
				ret = mul(ret, a);
			}
		}
		return ret;
	}

	long[][] mul(long[][] a, long[][] b) {
		long[][] ret = new long[a.length][b[0].length];
		for (int i = 0; i < a.length; ++i) {
			for (int j = 0; j < b[i].length; ++j) {
				for (int k = 0; k < a[i].length; ++k) {
					ret[i][j] = (ret[i][j] + a[i][k] * b[k][j] % MOD) % MOD;
				}
			}
		}
		return ret;
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}