import sys, random
input = lambda : sys.stdin.readline().rstrip()


write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO); INF=10**18
LI = lambda : list(map(int, input().split())); II=lambda : int(input())
def debug(_l_):
    for s in _l_.split():
        print(f"{s}={eval(s)}", end=" ")
    print()
def dlist(*l, fill=0):
    if len(l)==1:
        return [fill]*l[0]
    ll = l[1:]
    return [dlist(*ll, fill=fill) for _ in range(l[0])]

def hurui(n):
    """線形篩
    pl: 素数のリスト
    mpf: iを割り切る最小の素因数
    """
    pl = []
    mpf = [None]*(n+1)
    for d in range(2,n+1):
        if mpf[d] is None:
            mpf[d] = d
            pl.append(d)
        for p in pl:
            if p*d>n or p>mpf[d]:
                break
            mpf[p*d] = p
    return pl, mpf
from collections import defaultdict
def factor(num):
    d = defaultdict(int)
    if num==1:
        d.update({1:1})
        return d
    while num>1:
        d[mpf[num]] += 1
        num //= mpf[num]
    return d
def fs(num):
    f = factor(num)
    ans = [1]
    for k,v in f.items():
        tmp = []
        for i in range(len(ans)):
            val = 1
            for _ in range(v):
                val *= k
                ans.append(ans[i]*val)
    return ans

n,p,q = list(map(int, input().split()))
pl, mpf = hurui(2*n+10)
M = 998244353
if n==1:
    ans = 1
elif p+q<=n:
    ans = 1
    if p>1:
        ans *= 2
    if q>1:
        ans *= 2
elif p==q==n:
    ans = 2
elif p==1 or q==1:
    ans = 2
else:
    dp = [[-1]*n for _ in range(2)]
    np = list(range(n))
    nq = list(range(n))
    for i in range(p):
        np[i] = p-1-i
    for i in range(n-q,n):
        nq[i] = n-1-(i - (n-q))
    nx = [np, nq]
    cs = []
    kv = {}
    for i in range(2):
        for j in range(n):
            if dp[i][j]!=-1:
                continue
            c = 1
            dp[i][j] = (i,j)
            ii = 1-i
            jj = nx[i][j]
            while ii!=i or jj!=j:
                dp[ii][jj] = (i,j)
                c += 1
                jj = nx[ii][jj]
                ii = 1-ii
            f = factor(c)
            cs.append(c)
            for k,v in f.items():
                kv.setdefault(k,0)
                kv[k] = max(kv[k], v)
    ans = 1
    for k,v in kv.items():
        ans *= pow(k,v,M)
        ans %= M
print(ans%M)