import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

sys.setrecursionlimit(3*10**5)

def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    return (g1[n] * g2[r] % mod) * g2[n-r] % mod

mod = 998244353
N = 3*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)

for i in range( 2, N + 1 ):
    g1[i]=( ( g1[i-1] * i ) % mod )
    inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0

N,X,Y = mi()
if X > Y:
    X,Y = Y,X

if X!=1:
    N,X,Y = N-X,1,Y-X
    if Y==1:
        if N==1:
            exit(print(1))
        else:
            exit(print(0))

memo = {(1,1,1):1,(4,1,4):2}
def calc(n,x,y):
    if (n,x,y) in memo:
        return memo[n,x,y]
    
    if y==x+1:
        memo[n,x,y] = 1
        return memo[n,x,y]
    
    res = 0
    if x+1!=y:
        res += calc(n-1,1,y-1)
        res %= mod
    if x+1!=y and x+2!=y and x+3!=y and x+3 <= n:
        res += calc(n-3,1,y-3)
        res %= mod
    memo[n,x,y] = res
    return res

print(calc(N,X,Y))
#print(memo)