// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#include <bits/stdc++.h>
// #define int long long
#define i64 long long
#define pii pair <int, int> 
using namespace std;
inline int read(void) {
    int x=0,sgn=1; char ch=getchar();
    while(ch<48||57<ch) {if(ch==45)sgn=0;ch=getchar();}
    while(47<ch&&ch<58) {x=x*10+ch-48;   ch=getchar();}
    return sgn? x:-x;
}
void write(__int128 x) {
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
/*
    write((Ans%p+p)%p); pls
*/
const int p=998244353;
inline void Add(int&x,const int y) { (x+=y)>=p && (x-=p); }
inline int ksm(int x,int a=p-2) {
    int res=1;
    for(; a; a>>=1,x=1ll*x*x%p) (a&1) && (res=1ll*res*x%p);
    return res;
} 
i64 fac[30000007],ifc[30000007];
inline void init(const int L) {  // Please make sure that L <= N
    fac[0]=1;
    for(int i=1; i<=L; ++i) fac[i]=fac[i-1]*i%p;
    ifc[L]=ksm(fac[L]);
    for(int i=L; i>=1; --i) ifc[i-1]=ifc[i]*i%p;
}
inline int C(int a,int b) { return fac[a]*ifc[b]%p*ifc[a-b]%p; }
inline int P(int x,int y) { return fac[x+y]*ifc[x]%p*ifc[y]%p; }
int n,d,r,cntp;
int isp[30000007],f[30000007],pri[3000006];
inline int calc(int k) {
    if(k<=r) return k==1; 
    if((k-r)&1) return p-C(k-2,r-1);
    return C(k-2,r-1);
}
signed main() {
    // freopen("localinput","r",stdin);
    // freopen("localoutput","w",stdout);
    n=read(); d=read(); r=read(); isp[1]=1; init(n+d);
    for(int i=2; i<=d; ++i) if(!isp[i]) {
        pri[++cntp]=i;
        for(int u=i; u<=d; u+=i) isp[u]=1;
    }
    for(int i=1; i<=d; ++i) f[i]=P(d-i,n-1);
    for(int u=1; u<=cntp; ++u) 
        for(int i=d/pri[u]; i>=1; --i) 
            Add(f[i],f[i*pri[u]]);
    __int128 Ans=0;
    for(int i=1; i<=n; ++i) Ans+=(__int128)(1ll*C(n,i)*calc(i))*f[i];
    Ans=(Ans%p*ksm(P(n-1,d))+r)%p;
    write(Ans); puts("");
    // fprintf(stderr,"%.4lf\n",1.0*clock()/CLOCKS_PER_SEC);
    return 0;
}