mod = 998244353 def main(): import sys input = sys.stdin.readline class UnionFind(): def __init__(self, n): self.n = n self.root = [-1] * (n + 1) self.rnk = [0] * (n + 1) def find_root(self, x): while self.root[x] >= 0: x = self.root[x] return x def unite(self, x, y): x = self.find_root(x) y = self.find_root(y) if x == y: return elif self.rnk[x] > self.rnk[y]: self.root[x] += self.root[y] self.root[y] = x else: self.root[y] += self.root[x] self.root[x] = y if self.rnk[x] == self.rnk[y]: self.rnk[y] += 1 def isSameGroup(self, x, y): return self.find_root(x) == self.find_root(y) def size(self, x): return -self.root[self.find_root(x)] N, p, q = map(int, input().split()) if p + q <= N: if p == q == 1: print(1) elif p == 1 or q == 1: print(2) else: print(4) exit() if p == q == N: print(2) exit() UF = UnionFind(N) for i in range(1, p+1): if i * 2 >= p + 1: break UF.unite(i, p + 1 - i) for i in range(1, q+1): if i * 2 >= q + 1: break UF.unite(N - i + 1, N - q + i) S = [] for i in range(1, N+1): if i == UF.find_root(i): S.append(UF.size(i)) S = list(set(S)) S.sort(reverse=True) ans = 1 for s in S: ans = (ans * s) % mod if len(S) > 1: ans = (ans * 2) % mod print(ans) if __name__ == '__main__': main()