n, x, y = map(int,input().split())
if y < x: x, y = y, x
mod = 998244353
dp = [0] * (2 * 10 ** 5 + 1)
#S = 0, T = N - 1の場合の答え
dp[0] = 0
dp[1] = 1
dp[2] = 1
for i in range(3, 2 * 10 ** 5 + 1):
    dp[i] = dp[i - 1] + dp[i - 3]
    dp[i] %= mod
if x == 1:
    print(dp[y])
elif y == n:
    print(dp[y - x])
else:
    print(dp[y - x - 1])