/*
I know this sky loves you
いずれ全て
変わってしまったって
空は青いだろうよ
*/

# include <bits/stdc++.h>

const int N=10000010,INF=0x3f3f3f3f,mod=998244353,V=N-10;

inline int read(void){
	int res,f=1;
	char c;
	while((c=getchar())<'0'||c>'9')
		if(c=='-') f=-1;
	res=c-48;
	while((c=getchar())>='0'&&c<='9')
		res=res*10+c-48;
	return res*f;
}

int n,k;

inline int adc(int a,int b){return (a+b>=mod)?(a+b-mod):(a+b);}
inline int dec(int a,int b){return (a<b)?(a-b+mod):(a-b);}
inline int mul(int a,int b){return 1ll*a*b%mod;}
inline void add(int &a,int b){a=adc(a,b);}
inline void del(int &a,int b){a=dec(a,b);}

int inv[N];

inline void init(void){
	inv[1]=1;
	for(int i=2;i<=V;++i) inv[i]=mul(inv[mod%i],dec(mod,mod/i));
	return;
}

int f[N],g[N];

int main(void){
//	freopen("b.in","r",stdin);
//	freopen("b.out","w",stdout);
	init();
	
	n=read(),k=read();
	g[0]=1;
	for(int i=1;i<=n-1;++i) g[0]=mul(g[0],i);
	
	for(int i=1;i<=n;++i){
		f[i]=g[i-1];
		if(i-k-1>=0) del(f[i],g[i-k-1]);
		g[i]=adc(g[i-1],mul(inv[n-i],f[i]));
	}
	
	printf("%d",f[n]);

	return 0;
}