def factorial(n):
    F = [1]
    for i in range(1, n+1):
        F.append(F[-1]*i%MOD)
    invF = [pow(F[-1], -1, MOD)]
    for i in reversed(range(n)):
        invF.append(invF[-1]*(i+1)%MOD)
    invF = invF[::-1]
    return F, invF

class CP:
    def __init__(self, N):
        self.fact = [1]*(N+1)
        self.fact_inv = [1]*(N+1)
        for i in range(2, N+1):
            self.fact[i] = self.fact[i-1]*i%MOD
        self.fact_inv[N] = pow(self.fact[N], -1, MOD)
        for i in reversed(range(1, N)):
            self.fact_inv[i] = self.fact_inv[i+1]*(i+1)%MOD
    def C(self, N, K):
        if N < 0 or K < 0 or N < K:
            return 0
        return self.fact[N]*self.fact_inv[K]%MOD*self.fact_inv[N-K]%MOD
    def P(self, N, K):
        if N < 0 or K < 0 or N < K:
            return 0
        return self.fact[N]*self.fact_inv[N-K]%MOD
    def H(self, N, K):
        if N < 0 or K < 0:
            return 0
        if N == K == 0: return 1
        return self.C(N+K-1, K)

def inverse(n, d):
    return n * pow(d, -1, MOD) % MOD

MOD = 998244353
F, invF = factorial(10**6+1)
cp = CP(10**6+1)

N, Q = map(int, input().split())

ans = 0
for i in range(1, N+1):
    ans += cp.C(N+1, i+1)*F[i]%MOD*F[N-i]%MOD*(N-i+1)%MOD
    ans %= MOD

ans *= pow(inverse(N*(N+1)%MOD, 2), Q-1, MOD)*Q%MOD
ans %= MOD

print(ans)