#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using ll=long long;
namespace polynomial
{
	constexpr int P(998244353),N(200010),PR(3),APR((P+1)/PR);
	int ws[2][N<<2],fn,fb,inv[N<<2],rev[N<<2],fac[N<<2],ifac[N<<2];
	int fast_pow(int a,int b){int ans(1),off(a);while(b){if(b&1) ans=1ll*ans*off%P;off=1ll*off*off%P;b>>=1;}return ans;}
	void init_poly_weights(int len)
	{
		fn=1,fb=0;while(fn<(len<<1)) fn<<=1,++fb;
		inv[1]=1;for(int i(2);i<=fn;++i) inv[i]=1ll*(P-P/i)*inv[P%i]%P;
		fac[0]=ifac[0]=1;for(int i(1);i<=fn;++i) fac[i]=1ll*fac[i-1]*i%P,ifac[i]=1ll*ifac[i-1]*inv[i]%P;
		for(int i(0);i<fn;++i) rev[i]=(rev[i>>1]>>1)|((i&1)<<(fb-1));
		for(int mid((fn>>1)),j0(fast_pow(PR,(P-1)/(mid<<1))),j1(fast_pow(APR,(P-1)/(mid<<1)));mid>=1;mid>>=1,j0=1ll*j0*j0%P,j1=1ll*j1*j1%P)
		for(int i(0),w0(1),w1(1);i<mid;++i,w0=1ll*w0*j0%P,w1=1ll*w1*j1%P) ws[0][i+mid]=w0,ws[1][i+mid]=w1;
	}
	using poly=std::vector<int>;
	int redu(int k){return k>=P?k-P:k;}
	poly operator+(const poly &a,const poly &b)
	{
		poly ret(b);if(ret.size()<a.size()) ret.resize(a.size());
		for(int i(0);i<a.size();++i) ret[i]=redu(ret[i]+a[i]);
		return ret;
	}
	unsigned long long tt[N<<2];
	int ntt_bits(int k){return std::__lg(std::max(k-1,1))+1;}
	void NTT(poly &p,int V)
	{
		int bts(ntt_bits(p.size()));if(p.size()!=(1<<bts)) p.resize((1<<bts));
		int* w(ws[(V==1)?0:1]),len(1<<bts);for(int i(0);i<len;++i) tt[i]=p[rev[i]>>(fb-bts)];
		unsigned long long t1,t2;
		for(int l(2);l<=len;l<<=1)
			for(int j(0),mid=(l>>1);j<len;j+=l)
				for(int i(0);i<mid;++i) t1=tt[j+i],t2=tt[j+i+mid]*w[mid+i]%P,tt[j+i]=t1+t2,tt[j+i+mid]=P+t1-t2;
		if(V==1) for(int i(0);i<len;++i) p[i]=tt[i]%P;
		else for(int i(0),j(inv[len]);i<len;++i) p[i]=tt[i]%P*j%P;
	}
	poly operator*(const poly &a,const poly &b)
	{
		static poly p1,p2;poly ret;
		p1=a,p2=b;int len(a.size()+b.size()-1),ff(1<<ntt_bits(len));
		p1.resize(ff),p2.resize(ff),ret.resize(ff);
		NTT(p1,1);NTT(p2,1);
		for(int i(0);i<ff;++i) ret[i]=1ll*p1[i]*p2[i]%P;
		NTT(ret,-1);ret.resize(len);return ret;
	}
	poly poly_inv(const poly &a)
	{
		int l(a.size());if(l==1){poly ret(1);ret[0]=fast_pow(a[0],P-2);return ret;}
		poly g0(a);g0.resize((l+1)>>1);g0=poly_inv(g0);int t(g0.size()),tb(ntt_bits(t<<1));
		poly f(a),g(g0);f.resize(1<<tb);g0.resize(1<<tb);NTT(f,1);NTT(g0,1);
		for(int i(0);i<(1<<tb);++i) f[i]=(1+1ll*(P-f[i])*g0[i])%P;
		NTT(f,-1);f.erase(f.begin(),f.begin()+t);f.resize(1<<tb);
		NTT(f,1);for(int i(0);i<(1<<tb);++i) f[i]=1ll*f[i]*g0[i]%P;
		NTT(f,-1);g.resize(l);std::copy(f.begin(),f.begin()+l-t,g.begin()+t);return g;
	}
	poly poly_ln(const poly &a)
	{
		int l(a.size());static poly p1;
		p1.resize(l-1);for(int i(1);i<l;++i) p1[i-1]=1ll*i*a[i]%P;
		p1=p1*poly_inv(a);p1.resize(l-1);poly ret(l);
		for(int i(1);i<l;++i) ret[i]=1ll*inv[i]*p1[i-1]%P;ret[0]=0;
		return ret;
	}
	poly poly_exp(const poly &a)
	{
		int l(a.size());if(l==1){poly ret(1);ret[0]=1;return ret;}
		poly g0(a);g0.resize((l+1)>>1);g0=poly_exp(g0);static poly g1,g2;g1=g0;g1.resize(l);g1=poly_ln(g1);g2=a;
		int ff(2<<ntt_bits(l));g0.resize(ff);g1.resize(ff);poly ret(ff);g2.resize(ff);
		NTT(g0,1);NTT(g1,1);NTT(g2,1);
		for(int i(0);i<ff;++i) ret[i]=1ll*g0[i]*(1-g1[i]+g2[i]+P)%P;
		NTT(ret,-1);ret.resize(l);return ret;
	}
	poly poly_pow(const poly &a,int k)
	{
		int l(a.size());
		if(!k){poly r(l);r[0]=1;return r;}
		int i(0);while(i<l && !a[i]) ++i;
		if(1ll*i*k>=l) return poly(l);
		poly f(a.begin()+i,a.begin()+i+l-i*k);
		int t(f[0]),_t(fast_pow(t,P-2));
		for(int &v:f) v=1ll*_t*v%P;t=fast_pow(t,k);
		f=poly_ln(f);
		for(int &v:f) v=1ll*v*k%P;
		f=poly_exp(f);
		for(int &v:f) v=1ll*t*v%P;
		f.resize(l);
		std::rotate(f.begin(),f.begin()+l-i*k,f.end());
		return f;
	}
	poly poly_shift(poly a,int k)
	{
		int l(a.size());
		poly tr(l);
		for(int i(0),j(1);i<l;++i,j=1ll*j*k%P) tr[i]=1ll*j*ifac[i]%P;
		for(int i(0);i<l;++i) a[i]=1ll*fac[i]*a[i]%P;
		std::reverse(a.begin(),a.end());
		a=a*tr;a.resize(l);std::reverse(a.begin(),a.end());
		for(int i(0);i<l;++i) a[i]=1ll*ifac[i]*a[i]%P;
		return a;
	}
}
using polynomial::poly;
using polynomial::init_poly_weights;
using polynomial::operator+;
using polynomial::operator*;
using polynomial::init_poly_weights;
using polynomial::poly_inv;
using polynomial::poly_ln;
using polynomial::poly_exp;
using polynomial::poly_pow;
using polynomial::poly_shift;
using polynomial::ifac;
using polynomial::fac;
using polynomial::inv;
constexpr int N(1e5+10),p(998244353),_2((p+1)/2);
int fp(int a,int b){int ans(1),off(a);while(b){if(b&1) ans=1ll*ans*off%p;off=1ll*off*off%p;b>>=1;}return ans;}
int main()
{
	int D,n,m;std::cin>>D>>n>>m;init_poly_weights(D+1);
	if(m*2>n){std::cout<<"0"<<std::endl;return 0;}
	int l(std::min(D,n-2*m));
	poly F(D+1),G(D+1);
	for(int i(D-l);i<=D;++i) F[i]=1ll*fac[D]*ifac[i]%p;
	for(int i(0);i<=D;++i) G[i]=(i&1)?p-ifac[i]:ifac[i];
	F=F*G;F.resize(D+1);
	for(int j(D),t(1);j>=0;--j,t=2*t%p) F[j]=1ll*F[j]*t%p*ifac[D-j]%p;
	// for(int v:F) std::cout<<v<<" ";std::cout<<std::endl;
	F=poly_shift(F,1);
	// for(int v:F) std::cout<<v<<" ";std::cout<<std::endl;
	static int ps[N],val[N];int pc(0);static bool vis[N];val[1]=1;
	for(int i(2);i<=D;++i)
	{
		if(!vis[i]) val[i]=fp(i,n),ps[++pc]=i;
		for(int j(1);j<=pc && ps[j]*i<=D;++j)
		{
			val[ps[j]*i]=1ll*val[ps[j]]*val[i]%p;
			vis[ps[j]*i]=true;
			if((i%ps[j])==0) break;
		}
	}
	int ans(0);
	for(int i(0);i<=D;++i)
	{
		int t(D-i*2);
		if(t<0 && n&1) ans=(ans+1ll*(p-val[std::abs(t)])*F[i])%p;
		else ans=(ans+1ll*val[std::abs(t)]*F[i])%p;
	}
	std::cout<<1ll*ans*fp(_2,D)%p<<std::endl;
	return 0;
}