MOD = 998244353
N = 200200
fact = [0 for _ in range(N)]
invfact = [0 for _ in range(N)]
fact[0] = 1
for i in range(1, N):
    fact[i] = fact[i - 1] * i % MOD

invfact[N - 1] = pow(fact[N - 1], MOD - 2, MOD)

for i in range(N - 2, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % MOD

def nCk(n, k):
    if k < 0 or n < k:
        return 0
    else:
        return (fact[n] * invfact[k] % MOD) * invfact[n - k] % MOD

def nHk(n, k):
    return nCk(n + k - 1, k)

n, m, k = map(int, input().split())
if m + k >= n:
    x = m + k - n
    m -= x
    k -= x
    ans = 0
    for i in range(min(m, k) + 1):
        ans += (nCk(m, i) * nCk(k, i) % MOD) * fact[i] % MOD
        ans %= MOD
    print(ans)
else:
    ans = 0
    for i in range(min(m, k) + 1):
        ans += (nCk(m, i) * nCk(k, i) % MOD) * fact[i] % MOD
        ans %= MOD
    for i in range(m + k + 1, n + 1):
        ans *= i
        ans %= MOD
    print(ans)