mod=998244353

fact=[1]
for i in range(1,10**5):
  fact.append(fact[-1]*i%mod)

dp=[[0]*3010 for i in range(3010)]
N,K,X=map(int,input().split())
for k in range(1,3005):
  n=N-K+k
  if k==1:
    for x in range(1,3005):
      res=fact[n-1]*(fact[n-1]-1)//2%mod+(x-1)*fact[n-1]%mod*fact[n-1]
      dp[k][x]=res%mod
  else:
    for x in range(1,3005):
      res=0
      if x>1:
        res+=(x-2)*(x-1)//2*fact[n-1]%mod*fact[n-2]
        res+=(x-1)*dp[k-1][x-1]
      if n-x>=0:
        res+=(n*(n-1)-x*(x-1))//2*fact[n-1]%mod*fact[n-2]
        res+=(n-x)*dp[k-1][x]
      dp[k][x]=res%mod

print(dp[K][X])