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

FACT=[1]
for i in range(1,5*10**5+1):
    FACT.append(FACT[-1]*i%mod)

FACT_INV=[pow(FACT[-1],mod-2,mod)]
for i in range(5*10**5,0,-1):
    FACT_INV.append(FACT_INV[-1]*i%mod)

FACT_INV.reverse()

def Combi(a,b):
    if 0<=b<=a:
        return FACT[a]*FACT_INV[b]%mod*FACT_INV[a-b]%mod
    else:
        return 0

if M+K>N:
    x=(M+K)-N

    N-=x
    M-=x
    K-=x

MIN=min(M,K)
ANS=0
rest=N-M-K

xx=FACT[N]*pow(FACT[M+K],mod-2,mod)

for i in range(MIN+1):
    ANS+=xx*Combi(M,i)*Combi(K,i)*FACT[i]%mod
    ANS%=mod

print(ANS)