n,k = map(int,input().split())
MOD = 998244353

dpn = [[0]*k for _ in range(k)]
dps = [[0]*k for _ in range(k)]
for i in range(k):
    for j in range(i+1,k):
            dpn[i][j] = dpn[j][i] = 1
            dps[i][j] = dps[j][i] = i+j

for I in range(n-2):
    ndpn = [[0]*k for _ in range(k)]
    ndps = [[0]*k for _ in range(k)]
    for i in range(k):
        for j in range(i+1,k):
            for p in range(j):
                if i==p: continue
                ndpn[j][p] += dpn[i][j]
                ndpn[j][p] %= MOD
                ndps[j][p] += dps[i][j] + dpn[i][j]*p
                ndps[j][p] %= MOD
        for j in range(i):
            for p in range(j+1,k):
                if i==p: continue
                ndpn[j][p] += dpn[i][j]
                ndpn[j][p] %= MOD
                ndps[j][p] += dps[i][j] + dpn[i][j]*p
                ndps[j][p] %= MOD

    dpn = ndpn
    dps = ndps

v = sum(sum(i) for i in dpn)%MOD
w = sum(sum(i) for i in dps)%MOD
print(v,w)