import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N,K = MI()
mod = 998244353

dp = [[[0]*K for _ in range(K)] for _ in range(N+1)]
# dp[i][j][k] = 長さiで最後がk,jである門松列列の個数
S_dp = [[[0]*K for _ in range(K)] for _ in range(N+1)]
# S_dp[i][j][k] = dp[i][j][0]+…+dp[i][j][k]
for j in range(K):
    for k in range(K):
        if j != k:
            dp[2][j][k] = 1

        if k == 0:
            S_dp[2][j][k] = dp[2][j][k]
        else:
            S_dp[2][j][k] = S_dp[2][j][k-1]+dp[2][j][k]
            S_dp[2][j][k] %= mod

for i in range(3,N+1):
    for j in range(K):
        for k in range(K):
            if j < k:
                dp[i][j][k] = S_dp[i-1][k][k-1]-dp[i-1][k][j]
            elif j > k:
                dp[i][j][k] = S_dp[i-1][k][K-1]-S_dp[i-1][k][k]-dp[i-1][k][j]
            dp[i][j][k] %= mod

            if k == 0:
                S_dp[i][j][k] = dp[i][j][k]
            else:
                S_dp[i][j][k] = S_dp[i][j][k-1]+dp[i][j][k]
                S_dp[i][j][k] %= mod

ans1 = 0
for j in range(K):
    ans1 += S_dp[-1][j][-1]
    ans1 %= mod

ans2 = ans1*N*(K-1)*(mod+1)//2
ans2 %= mod

print(ans1,ans2)