import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

n, k = LI()

k2 = k**2
k3 = k**3

mat = [[0]*k3 for _ in range(k3)]

def pack(a, b, c):
    return c*k2+b*k+a

def unpack(abc):
    bc, a = divmod(abc, k)
    c, b = divmod(bc, k)
    return a, b, c

for s in range(k3):
    a, b, c = unpack(s)
    t = pack((a+1)%k, b, c)
    mat[s][t] += 1
    t = pack(a, (a+b)%k, c)
    mat[s][t] += 1
    t = pack(a, b, (b+c)%k)
    mat[s][t] += 1

def dot(aa, bb):
    h = len(aa)
    w = len(bb[0])
    res = [[0]*w for _ in range(h)]
    for i, row in enumerate(aa):
        for j, col in enumerate(zip(*bb)):
            v = 0
            # for a, b in zip(row, col): v += a*b
            # res[i][j] = v
            for a, b in zip(row, col): v += a*b%md
            res[i][j] = v%md
    return res

def matpow(mat, e):
    n = len(mat)
    res = [[1 if i == j else 0 for j in range(n)] for i in range(n)]
    while e:
        if e & 1: res = dot(res, mat)
        mat = dot(mat, mat)
        e >>= 1
    return res

mat = matpow(mat, n)
ans = 0
for s in range(k3):
    a, b, c = unpack(s)
    if c == 0:
        ans += mat[0][s]
        ans %= md

print(ans)