from collections import defaultdict
mod = 998244353


def prime_factorization(n):  # 素因数分解
    res = []
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            cnt = 0
            while n % i == 0:
                cnt += 1
                n //= i
            res.append((i, cnt))
    if n > 1:
        res.append((n, 1))
    return res


class UnionFind:
    def __init__(self, n):
        self.root = [-1] * (n + 1)

    def find(self, x):
        stack = []
        while self.root[x] >= 0:
            stack.append(x)
            x = self.root[x]
        for i in stack:
            self.root[i] = x
        return x

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if -self.root[x] > -self.root[y]:
            x, y = y, x
        self.root[y] += self.root[x]
        self.root[x] = y
        return True

    def size(self, x):
        return -self.root[self.find(x)]


def main(N, p, q):

    if p == 1 and q == 1:
        return 1
    if p == 1 or q == 1:
        return 2
    if p + q <= N:
        return 4

    A = list(range(N))
    for i in range(p):
        j = p - 1 - i
        if i < j:
            A[i], A[j] = A[j], A[i]
    for i in range(q):
        j = q - 1 - i
        i = N - 1 - i
        j = N - 1 - j
        if i < j:
            A[i], A[j] = A[j], A[i]

    uf = UnionFind(N)
    for i, a in enumerate(A):
        uf.unite(i, a)

    prime = defaultdict(int)
    for i in range(N):
        if i == uf.find(i):
            for k, v in prime_factorization(uf.size(i)):
                if prime[k] < v:
                    prime[k] = v

    res = 1
    for k, v in prime.items():
        res = res * pow(k, v, mod) % mod
    return res * 2 % mod


N, p, q = map(int, input().split())
print(main(N, p, q))