MOD = 998244353

def main():
    import sys
    input = sys.stdin.read
    data = input().strip().split()
    N = int(data[0])
    B = int(data[1])
    W = int(data[2])
    
    if B == 0:
        if W == 0:
            print(1)
        else:
            print(0)
        return
    
    m = N - W - 2 * B
    if m < 1 or m > B:
        print(0)
        return
    
    # Compute combinatorial numbers using Lucas theorem or precomputed factorials
    # Precompute factorial and inverse factorial modulo MOD
    max_n = max(N, B, m)
    fact = [1] * (max_n + 1)
    for i in range(1, max_n + 1):
        fact[i] = fact[i-1] * i % MOD
    inv_fact = [1] * (max_n + 1)
    inv_fact[max_n] = pow(fact[max_n], MOD-2, MOD)
    for i in range(max_n-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
    
    ways_partition = comb(B-1, m-1)
    ways_place = comb(N - B - m, m)
    total = ways_partition * ways_place % MOD
    print(total)

if __name__ == "__main__":
    main()