MOD = 998244353

max_fact = 2 * 10**5 + 10
fact = [1] * (max_fact + 1)
for i in range(1, max_fact + 1):
    fact[i] = fact[i-1] * i % MOD

inv_fact = [1] * (max_fact + 1)
inv_fact[max_fact] = pow(fact[max_fact], MOD-2, MOD)
for i in range(max_fact - 1, -1, -1):
    inv_fact[i] = inv_fact[i+1] * (i+1) % MOD

def comb(n, k):
    if n < 0 or k < 0 or n < k:
        return 0
    return fact[n] * inv_fact[k] % MOD * inv_fact[n - k] % MOD

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

if W == N - 3 * B and N >= 3 * B and W >= 0:
    n = N - 2 * B
    print(comb(n, B) % MOD)
else:
    print(0)