#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=30000010,MOD=998244353;
const char en='\n';
const ll LLINF=1ll<<60;

int mul(int a,int b)
{
    return a*1ll*b%MOD;
}

int pot(int n,int k)
{
    if (k==0) return 1;
    int r=pot(n,k/2);
    r=mul(r,r);
    if (k%2) r=mul(r,n);
    return r;
}

int add(int a,int b)
{
    if (a+b>=MOD) return a+b-MOD;
    return a+b;
}

void ad(int&a,int b)
{
    a+=b;
    if (a>=MOD) a-=MOD;
}

void su(int&a,int b)
{
    a-=b;
    if (a<0) a+=MOD;
}

int n,d,r,fac[N],inf[N],cn1[N];

int cho(int a,int b)
{
    if (b<0 || b>a) return 0;
    return mul(fac[a],mul(inf[b],inf[a-b]));
}

int RR(int b,int c,int d)
{
    return cho(c+1,b+d+1);
}

int R(int a,int b,int c,int d)
{
    return RR(b,c-a,d);
}

int F(int c)
{
    int s=0;
    if (c==n)
    {
        for (int m=0;m<=d/n;++m) ad(s,cn1[d-1-n*m]);
        return s;
    }
    for (int m=0;m<d/c;++m)
    {
        //ad(s,cho(n+d-1-c*(m+1),n-1));
        ad(s,cn1[n+d-1-c*(m+1)]);
    }
    return s;
}

int invcho(int a,int b)
{
    if (b<0 || b>a) return 0;
    return mul(inf[a],mul(fac[b],fac[a-b]));
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    fac[0]=1;
    for (int i=1;i<N;++i) fac[i]=mul(fac[i-1],i);
    inf[N-1]=pot(fac[N-1],MOD-2);
    for (int i=N-2;i>=0;--i) inf[i]=mul(i+1,inf[i+1]);
    cin>>n>>d>>r;
    //n=1.5e7;
    //d=1.5e7;
    //r=1;
    for (int i=n-1;i<=n-1+d;++i) cn1[i]=cho(i,n-1);
    int od=0;
    ad(od,mul(n,F(1)));
    for (int i=1;i<=n-r;++i)
    {
        if (i%2) su(od,mul(mul(cho(n,r+i),cho(i+r-2,r-1)),F(r+i)));
        else ad(od,mul(mul(cho(n,r+i),cho(i+r-2,r-1)),F(r+i)));
    }
    cout<<add(mul(od,invcho(n+d-1,n-1)),r)<<en;
}