MOD = 998244353

def main():
    import sys
    N, B, W = map(int, sys.stdin.readline().split())
    C = N - W

    if C < B:
        print(0)
        return

    if (C - B) % 2 != 0:
        print(0)
        return

    k = (C - B) // 2
    if k < 0:
        print(0)
        return

    required = B + 4 * k - 2
    if required > N:
        print(0)
        return

    available = N - required
    if available < 0:
        print(0)
        return

    max_n = max(B-1 + k, available + k + k)
    max_fact = max_n * 2

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

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

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

    c1 = comb(B-1, k-1)
    c2 = comb(available + k, k)

    ans = c1 * c2 % MOD
    print(ans)

if __name__ == '__main__':
    main()