import sys
input = sys.stdin.readline

N,K=map(int,input().split())
mod=998244353

DP=[[0]*K for i in range(K)]

for i in range(K):
    for j in range(i+1,K):
        DP[i][j]=1

for times in range(N-2):
    NDP=[[0]*(K+1) for i in range(K+1)]
    NDP2=[[0]*(K+1) for i in range(K+1)]

    if times % 2 == 0:
        
        for i in range(K):
            for j in range(K):
                NDP[j][j-1]+=DP[i][j]
                NDP2[j][i]-=DP[i][j]

        for i in range(K):
            for j in range(K-2,-1,-1):
                NDP[i][j]+=NDP[i][j+1]

        for i in range(K):
            for j in range(K):
                NDP[i][j]=(NDP[i][j]+NDP2[i][j])%mod
                
    else:
        for i in range(K):
            for j in range(K):
                NDP[j][j+1]+=DP[i][j]
                NDP2[j][i]-=DP[i][j]

        for i in range(K):
            for j in range(1,K):
                NDP[i][j]+=NDP[i][j-1]

        for i in range(K):
            for j in range(K):
                NDP[i][j]=(NDP[i][j]+NDP2[i][j])%mod

    DP=NDP

ANS=0
for i in range(K):
    for j in range(K):
        ANS+=DP[i][j]

print(ANS*2%mod,ANS*2*(K-1)*N*pow(2,mod-2,mod)%mod)