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

# class combination():

#     def __init__(self,N,p):
        
        
#         self.fact = [1, 1]  # fact[n] = (n! mod p)
#         self.factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
#         self.inv = [0, 1]  # factinv 計算用
#         self.p = p
        
#         for i in range(2, N + 1):
#             self.fact.append((self.fact[-1] * i) % p)
#             self.inv.append((-self.inv[p % i] * (p // i)) % p)
#             self.factinv.append((self.factinv[-1] * self.inv[-1]) % p)
        

#     def cmb(self,n, r):
#         if (r < 0) or (n < r):
#             return 0
#         r = min(r, n - r)
#         return self.fact[n] * self.factinv[r] * self.factinv[n-r] % self.p
    
# C = combination(K+1+N,mod)

ans = 0
C = 1
for i in range(N):

    if i%2==0:

        ans = (ans + C*pow(N-i,N+K,mod))%mod
    else:
        ans = (ans - C*pow(N-i,N+K,mod))%mod
    C = (N-i)*pow(i+1,mod-2,mod)*C%mod

inv = 1
for i in range(K+1,N+K+1):
    inv = (inv*i)%mod
inv = pow(inv,mod-2,mod)
ans = (ans*inv)%mod
inv = pow(pow(N,K,mod),mod-2,mod)
print(ans*inv%mod)