#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e5+5,M=1e6+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const ll INF=1e18+7;mt19937 rnd(263082);
int n,m,A,k;ll frc[N],inv[N];
ll C(int x,int y){if(x<y||y<0) return 0;return frc[x]*inv[y]%mod*inv[x-y]%mod;}
ll calc(int x,int y,int w){if(x>y) return 0;return C(y+1,w+1)-C(x,w+1)+mod;}
struct ques{int x,y,w;}q[N*2];int qh;
const int inv2=(mod+1)/2;
void Solve(){
	int i,j,h;scanf("%d%d%d",&n,&m,&A);
	if(m==1){puts("1");return;}
	inv[1]=1;for(i=2;i<=m;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	for(frc[0]=inv[0]=i=1;i<=m;i++) frc[i]=frc[i-1]*i%mod,inv[i]=inv[i-1]*inv[i]%mod;
	ll ans=0;
	auto push=[](int l,int r,int x,int w){q[++qh]=(ques){x,r,w},q[++qh]=(ques){x,l-1,-w};};
	for(i=1;i<=A;i++) {
		/*for(j=A;j<=n;j++){
			ans+=C((m+abs(i-A)-1)/2,j-i);
			ans-=C(m/2-1,j-i);
		}*/
		push(A-i,n-i,(m+abs(i-A)-1)/2,1);
		push(A-i,n-i,m/2-1,-1);
	}
	for(i=A;i<=n;i++){
		/*for(j=1;j<=A;j++) {
			ans+=C((m+abs(i-A)-1)/2,i-j);
			ans-=C((m+1)/2-1,i-j);
		}*/
		push(i-A,i-1,(m+abs(i-A)-1)/2,1);
		push(i-A,i-1,(m+1)/2-1,-1);
	}
	k=sqrt(max(n,m));
	sort(q+1,q+qh+1,[](ques x,ques y){return x.x/k==y.x/k?x.y<y.y:x.x<y.x;});
	int l=0,r=0;ll tot=1;
	for(i=1;i<=qh;i++){
		while(r<q[i].y) tot=(C(l,++r)+tot)%mod;
		while(r>q[i].y) tot=(tot-C(l,r--))%mod;
		while(l<q[i].x) tot=(tot*2-C(l++,r))%mod;
		while(l>q[i].x) tot=(tot+C(--l,r))*inv2%mod;
		ans+=tot*q[i].w;
	}
	printf("%lld\n",(ans%mod+mod)%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}