from collections import defaultdict, deque, Counter
from heapq import heapify, heappop, heappush
import math
from copy import deepcopy
from itertools import combinations, permutations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right

import sys

def input():
    return sys.stdin.readline().rstrip()
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getListGraph():
    return list(map(lambda x:int(x) - 1, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]

mod = 10 ** 9 + 7
MOD = 998244353
sys.setrecursionlimit(10000000)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
inf = float('inf')
eps = 10 ** (-15)
dy = [0, 1, 0, -1]
dx = [1, 0, -1, 0]

#############
# Main Code #
#############

"""
挿入DPっぽい

"""

N, X, Y = getNM()
if X > Y:
    X, Y = Y, X
if X > 1:
    X += 1
if Y < N:
    Y -= 1

if X > Y:
    print(0)
    exit()

l = Y - X + 1
dp = [0] * l
dp[0] = 1
for i in range(l - 1):
    dp[i + 1] += dp[i]
    dp[i + 1] %= MOD
    if i < l - 3:
        dp[i + 3] += dp[i]
        dp[i + 3] %= MOD
print(dp[-1] % MOD)