import sys
readline=sys.stdin.readline
import math
def LCM(a,b):
    return a*b//math.gcd(a,b)

N,P,Q=map(int,readline().split())
lst=[i for i in range(N)]
lst[:P]=lst[:P][::-1]
lst[-Q:]=lst[-Q:][::-1]
ans=1
mod=998244353
seen=[False]*N
for i in range(N):
    if seen[i]:
        continue
    cnt=0
    while not seen[i]:
        seen[i]=True
        cnt+=1
        i=lst[i]
    ans=LCM(ans,cnt)
if 2<=P and 2<=Q:
    ans*=2
ans%=mod
print(ans)