#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll mod=998244353,MX=1e7;
ll n,k,fac[MX+5],rfac[MX+5],dp[MX+5],c[MX+5],qs[MX+5];

ll binpow(ll a, ll n) {
    ll res=1;
    while (n) {
        if (n%2) res=(res*a)%mod;
        a=(a*a)%mod;
        n/=2;
    }
    return res;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>k;
    fac[0]=1;
    rfac[0]=1;
    for (ll i=1; i<=MX; ++i) {
        fac[i]=(fac[i-1]*i)%mod;
    }
    rfac[MX]=binpow(fac[MX],mod-2);
    for(ll i = MX - 1; i > 0;--i)
    {
        rfac[i] = rfac[i + 1] * (i + 1) % mod;
    }
    for (int i=1; i<=k; ++i) dp[i]=fac[i],qs[i]=(qs[i-1]+1)%mod;
    for (int i=k+1; i<=n; ++i) {
        dp[i]=(qs[i-1]-qs[i-k-1]+mod)%mod * fac[i-1]%mod;
        c[i]=(dp[i]*rfac[i])%mod;
        qs[i]=(qs[i-1]+c[i])%mod;
    }
    cout<<dp[n]<<"\n";
}