using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (n, k) = (c[0], c[1]); var len = k * k * k; var a = new long[1][]; a[0] = new long[len]; a[0][0] = 1; var x = new long[len][]; for (var i = 0; i < x.Length; ++i) x[i] = new long[len]; for (var ho = 0; ho < k; ++ho) for (var hm = 0; hm < k; ++hm) for (var hmr = 0; hmr < k; ++hmr) { var fkey = Key(k, ho, hm, hmr); var hkey = Key(k, (ho + 1) % k, hm, hmr); var mkey = Key(k, ho, (hm + ho) % k, hmr); var rkey = Key(k, ho, hm, (hmr + hm) % k); ++x[fkey][hkey]; ++x[fkey][mkey]; ++x[fkey][rkey]; } var b = Mul(a, Pow(x, n)); var ans = 0L; for (var ho = 0; ho < k; ++ho) for (var hm = 0; hm < k; ++hm) ans = (ans + b[0][Key(k, ho, hm, 0)]) % mod; WriteLine(ans); } static int Key(int k, int ho, int hm, int hmr) { return ho * k * k + hm * k + hmr; } static int mod = 998_244_353; // 行列の累乗 public static long[][] Pow(long[][] m, long k) { var multi = m; var r = new long[m.Length][]; for (var i = 0; i < m.Length; ++i) { r[i] = new long[m.Length]; r[i][i] = 1; } while (k > 0) { if ((k & 1) == 1) r = Mul(r, multi); multi = Mul(multi, multi); k >>= 1; } return r; } // 行列の積 public static long[][] Mul(long[][] x, long[][] y) { var r = new long[x.Length][]; for (var i = 0; i < x.Length; ++i) r[i] = new long[y[0].Length]; for (var i = 0; i < x.Length; ++i) for (var k = 0; k < x[0].Length; ++k) { for (var j = 0; j < y[0].Length; ++j) r[i][j] = (r[i][j] + x[i][k] * y[k][j]) % mod; } return r; } }