#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const int MAXN = 1e6+10;
ll fac[MAXN],rev[MAXN];
ll siz[MAXN<<1];bool is[MAXN];
#define ls(p)(p<<1)
#define rs(p)(p<<1|1)
ll ksm(ll a,ll b){
    ll re=1;
    while(b){
        if(b&1)re=re*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return re;
}
int n;
void Init(){
    fac[0]=1;
    for(int i=1;i<=n;++i)fac[i]=fac[i-1]*i%mod;
    rev[n]=ksm(fac[n],mod-2);
    for(int i=n-1;~i;--i)rev[i]=rev[i+1]*(i+1)%mod;
}
ll C(int n,int m){
   // if(n<m||n<=0||m<0)return 0;
   if(n<m)return 0; 
    return fac[n]*rev[m]%mod*rev[n-m]%mod;
}
void dfs(int u){
    if(u>n)return ;
    dfs(ls(u)),dfs(rs(u));
    siz[u]=1+siz[ls(u)]+siz[rs(u)];
    is[u]|=is[ls(u)]|is[rs(u)];
}
ll calc(int u){
    if(u>n)return 1;
    return C(siz[u]-1,siz[ls(u)])*calc(ls(u))%mod*calc(rs(u))%mod;
}
int x,y;
int main(){
    cin>>n>>x>>y;
    is[x]=1;
    Init();dfs(1);
    if(n-y+1>siz[x]){
        puts("0");return 0;
    }
    cout<<calc(1)<<endl;
    return 0;
}