#include <iostream>

using namespace std;
using ll = long long;
const int MX = 20000010;
ll f[MX],inv[MX],fi[MX];
constexpr ll mod = 998244353;
void solve(){
    inv[1] = 1;
    for(int i=2;i<MX;i++){
        inv[i] = mod - (mod/i)*inv[mod%i]%mod;
    }
    f[0] = fi[0] = 1;
    for(int i=1;i<MX;i++){
        f[i] = f[i-1]*i%mod;
        fi[i] = fi[i-1]*inv[i]%mod;
    }
}

ll nck(ll n, ll k){
    if(n<0 || k<0 || n<k) return 0;
    return f[n]*fi[k]%mod*fi[n-k]%mod;
}

int main(){
    ll i,n,m,k; cin >> n >> m >> k;
    solve();
    ll ans = nck(n,m);
    for(i=0;i<=n;i++){
        if(i*k>m || i*k>n) continue;
        ll x = nck(n - m + 1,i)*nck(n - i*k,n - m)%mod;
        if(i&1) (ans += x) %= mod;
        else (ans += mod - x) %= mod;
    }
    cout << ans << endl;
}