#include<bits/stdc++.h>
using namespace std;
long long n,k,f[10000009],g[10000009],in[10000009],ans;
const long long mod=998244353;
int main(){
//    freopen("b.in","r",stdin);
//    freopen("b.out","w",stdout);
    scanf("%lld%lld",&n,&k);
	if(k==1){
        puts("1");
        return 0;
    }
    ans=1;
	in[1]=1; 
    for(int i=2;i<=n;i++){
        ans=ans*i%mod;
        in[i]=(mod-mod/i)*in[mod%i]%mod;
    }
    f[0]=g[0]=in[n];in[0]=1;
    for(int i=1;i<=k;i++){
    	f[i]=g[i-1]*in[n-i]%mod;
    	g[i]=g[i-1]+f[i];
    	g[i]=g[i]>=mod?g[i]-mod:g[i];
	}
	for(int i=k+1;i<=n;i++){
		f[i]=(g[i-1]-g[i-k-1]+mod)*in[n-i]%mod;
    	g[i]=g[i-1]+f[i];
    	g[i]=g[i]>=mod?g[i]-mod:g[i];
	} 
    printf("%lld\n",f[n]*ans%mod);
    return 0;
}