MOD = 998244353

n, k = map(int, input().split())
edges = [[] for _ in range(k * k)]
f = lambda x, y: x * k + y
dp = [0] * (k * k)
tot = [0] * (k * k)
for i in range(k):
    for j in range(i + 1, k):
        dp[f(i, j)] = 1
        tot[f(i, j)] = i + j
        for i2 in range(j):
            if i2 == i:
                continue
            edges[f(i, j)].append((f(j, i2)))

for i in range(k):
    for j in range(i):
        dp[f(i, j)] = 1
        tot[f(i, j)] = i + j
        for i2 in range(j + 1, k):
            if i2 == i:
                continue
            edges[f(i, j)].append((f(j, i2)))

for _ in range(n - 2):
    dp2 = [0] * (k * k)
    tot2 = [0] * (k * k)
    for pos in range(k * k):
        for npos in edges[pos]:
            dp2[npos] += dp[pos]
            dp2[npos] %= MOD
            tot2[npos] += tot[pos] + dp[pos] * (npos % k)
            tot2[npos] %= MOD
    dp = dp2
    tot = tot2
print(sum(dp) % MOD, sum(tot) % MOD)