import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum long MO = 998244353;

int M;

long[][] mul(long[][] a, long[][] b) {
  auto c = new long[][](M, M);
  foreach (i; 0 .. M) foreach (k; 0 .. M) foreach (j; 0 .. M) {
    c[i][j] += a[i][k] * b[k][j];
    c[i][j] %= MO;
  }
  return c;
}

long N;
int K;

void main() {
  try {
    for (; ; ) {
      N = readLong();
      K = readInt();
      
      M = K^^3;
      int encode(int a, int b, int c) {
        return a + b * K + c * K^^2;
      }
      
      auto A = new long[][](M, M);
      foreach (a; 0 .. K) foreach (b; 0 .. K) foreach (c; 0 .. K) {
        ++A[encode((a + 1) % K, b, c)][encode(a, b, c)];
        ++A[encode(a, (b + a) % K, c)][encode(a, b, c)];
        ++A[encode(a, b, (c + b) % K)][encode(a, b, c)];
      }
      
      auto X = new long[][](M, M);
      auto Y = new long[][](M, M);
      foreach (i; 0 .. M) foreach (j; 0 .. M) {
        X[i][j] = A[i][j];
        Y[i][j] = (i == j) ? 1 : 0;
      }
      for (long e = N; e; e >>= 1) {
        if (e & 1) {
          Y = mul(Y, X);
        }
        X = mul(X, X);
      }
      
      long ans;
      foreach (a; 0 .. K) foreach (b; 0 .. K) {
        ans += Y[encode(a, b, 0)][encode(0, 0, 0)];
        ans %= MO;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}