import sys
import math

MOD = 998244353

def main():
    N, p, q = map(int, sys.stdin.readline().split())
    # Compute f[i] for each i
    f = [0] * (N + 1)  # 1-based indexing
    for i in range(1, N + 1):
        if i <= p:
            j = p + 1 - i
            if j >= (N - q + 1):
                f[i] = (2 * N - q + 1) - j
            else:
                f[i] = j
        else:
            if i >= (N - q + 1):
                f[i] = (2 * N - q + 1) - i
            else:
                f[i] = i
    
    visited = [False] * (N + 1)
    lcm = 1
    for i in range(1, N + 1):
        if not visited[i]:
            current = i
            cycle_length = 0
            while not visited[current]:
                visited[current] = True
                current = f[current]
                cycle_length += 1
            if cycle_length > 0:
                g = math.gcd(lcm, cycle_length)
                lcm = (lcm // g) * cycle_length
    # The answer is 2 * lcm mod MOD
    answer = (2 * lcm) % MOD
    print(answer)

if __name__ == "__main__":
    main()