MOD = 998244353

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

F, invF = factorial(10**6)

N, A, B = map(int, input().split())

if A == B:
    print((N-2)*F[N-1]%MOD)
else:
    print((F[N-1]+(N-2)*F[N-2]%MOD+(N-2)*(N-3)%MOD*F[N-2]%MOD)%MOD)