N, K = map(int, input().split())
mod = 998244353
pre = [[0] * K  for _ in range(K)] 
pre_sum = [[0] * K  for _ in range(K)]
Ac = [[0] * (K + 1) for _ in range(K + 1)]
Ac_sum = [[0] * (K + 1) for _ in range(K + 1)]
for a in range(K):
    for b in range(K):
        for c in range(K):
            if a == b or b == c or a == c:
                continue
            if a < b < c or c < b < a:
                continue
            pre[b][c] += 1
            pre_sum[b][c] += a + b + c
        
for a in range(K):
    for b in range(K):
        Ac[b][a + 1] = Ac[b][a] + pre[a][b]
        Ac_sum[b][a + 1] = Ac_sum[b][a] + pre_sum[a][b]
        Ac[b][a + 1] %= mod
        Ac_sum[b][a + 1] %= mod
        
for _ in range(N - 3):
    dp = [[0] * K  for _ in range(K)] 
    dp_sum = [[0] * K  for _ in range(K)]
    for a in range(K):
        for b in range(K):
            if a == b:
                continue
            if a < b:
                dp[a][b] += Ac[a][-1] - Ac[a][a + 1] - pre[b][a]
                dp_sum[a][b] += (Ac_sum[a][-1] - Ac_sum[a][a + 1]) + b * (Ac[a][-1] - Ac[a][a + 1] - pre[b][a]) - pre_sum[b][a]
            else:
                dp[a][b] += Ac[a][a] - pre[b][a] 
                dp_sum[a][b] += Ac_sum[a][a] + b * (Ac[a][a] - pre[b][a]) - pre_sum[b][a]
            dp[a][b] %= mod
            dp_sum[a][b] %= mod
            
    dp, pre = pre, dp
    dp_sum, pre_sum = pre_sum, dp_sum
            
    for a in range(K):
        for b in range(K):
            Ac[b][a + 1] = Ac[b][a] + pre[a][b]
            Ac_sum[b][a + 1] = Ac_sum[b][a] + pre_sum[a][b]
            Ac[b][a + 1] %= mod
            Ac_sum[b][a + 1] %= mod
            
ans1, ans2 = 0, 0
for a in range(K):
    for b in range(K):
        ans1 += pre[a][b]
        ans2 += pre_sum[a][b]
        ans1 %= mod
        ans2 %= mod
        
print(ans1, ans2)