from collections import defaultdict def pfact(m): pf = {} for i in range(2,int(m**0.5)+1): while m%i == 0: pf[i] = pf.get(i,0) + 1 m //= i if m>1 : pf[m]=1 return pf mod = 998244353 N, p, q = map(int,input().split()) if p == 1 and q == 1: print(1) elif p == 1: print(2) elif q == 1: print(2) elif p + q <= N: print(4) else: graph = [0] * 2*N # EVEN TO ODD for i in range(N): if i < p: graph[i] = p-1-i + N else: graph[i] = i + N # ODD TO EVEN for i in range(N): if N-q <= i: graph[N + i] = 2*N-q-1-i else: graph[N + i] = i tansaku = [0] * 2*N dic = defaultdict(int) for st in range(2 * N): if tansaku[st] == 0: tansaku[st] = 1 mada = [st] s = 1 while mada: i = mada.pop() if tansaku[graph[i]] == 0: tansaku[graph[i]] = 1 mada.append(graph[i]) s += 1 for i, j in pfact(s).items(): dic[i] = max(dic[i], j) ans = 1 for i, j in dic.items(): ans = ans * pow(i, j, mod) % mod print(ans)