MOD = 998244353

def main():
    import sys
    input = sys.stdin.read
    N, B, W = map(int, input().split())
    
    D = N - W
    if (D - B) < 0 or (D - B) % 2 != 0:
        print(0)
        return
    
    k = (D - B) // 2
    if B + 4 * k - 2 > N:
        print(0)
        return
    
    S = N - (B + 4 * k - 2)
    if S < 0:
        print(0)
        return
    
    # Precompute factorial and inverse factorial up to max needed
    max_needed = max(B + k, S + k)
    if max_needed > 2 * 10**5:
        print(0)
        return
    
    # Precompute factorial and inverse factorial
    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 k > n:
            return 0
        return fact[n] * inv_fact[k] % MOD * inv_fact[n - k] % MOD
    
    c1 = comb(B-1, k-1)
    c2 = comb(S + k, k)
    print((c1 * c2) % MOD)

if __name__ == "__main__":
    main()