def mmult(A, B):
    global mod
    n, m, l = len(A), len(B), len(B[0])
    ret = [[0] * l for _ in range(n)]
    for i in range(n):
        for j in range(m):
            for k in range(l):
                ret[i][k] = (ret[i][k] + A[i][j] * B[j][k]) % mod
    return ret
def mpow(A, n):
    if n == 1: return A
    if n == 0: return [[1 if i == j else 0 for j in range(len(A))] for i in range(len(A))]
    return mmult(mpow(A, n - 1), A) if n % 2 else mpow(mmult(A, A), n // 2)

mod = 998244353

P = 998244353
N, K = map(int, input().split())
KK = K ** 2
L = 2 * KK
M = [[0] * L for _ in range(L)]
A = [0] * L

X = [[1] * (K + 1) for _ in range(K)]
for i in range(K):
    for j in range(K):
        if i == j: continue
        A[i*K+j] = 1
        A[i*K+j+KK] = i + j

for i in range(K):
    for j in range(i):
        for k in range(j+1, K):
            if k == i: continue
            M[i*K+j][j*K+k] = 1
            M[i*K+j+KK][j*K+k+KK] = 1
            M[i*K+j][j*K+k+KK] = k
    for j in range(i+1, K):
        for k in range(j):
            if k == i: continue
            M[i*K+j][j*K+k] = 1
            M[i*K+j+KK][j*K+k+KK] = 1
            M[i*K+j][j*K+k+KK] = k

a = mmult([A], mpow(M, N - 2))[0]
print(sum(a[:KK]) % P, sum(a[KK:]) % P)