#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
const int mod=998244353;
const int MN=1e6+5;
ll ans,n,x,y,a[MN];
bool vis[MN];
void write(ll n){if(n<0){putchar('-');write(-n);return;}if(n>9)write(n/10);putchar(n%10+'0');}
ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
void dfs(ll step){
    if(step==x){
        if(a[step/2]<a[step]) dfs(step+1);
        return;
    }
    if(step==n+1){
        ans=(ans+1)%mod;
        return;
    }
    for(int i=a[step/2]+1; i<=n; i++) if(!vis[i]){
        a[step]=i;vis[i]=true;
        dfs(step+1);
        vis[i]=false;
    }
}
int main(){
    n=read();x=read();y=read();
    a[x]=y;vis[y]=true;
    dfs(1);
    write(ans);putchar('\n');
    return 0;
}