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

typedef double db;
typedef long long ll;
const int mod=998244353; 
const int N=1e7+100;

int mi(int x,int t){
	int d=1;
	while(t){
		if(t%2) d=(ll)d*x%mod;
		x=(ll)x*x%mod;t/=2;
	}
	return d;
}
int ni(int x) {return mi(x,mod-2);}

int f[N],fl[N],nf[N],Ni[N];

int main()
{
	
	
	int n,K;
	scanf("%d%d",&n,&K);
	
	fl[0]=1;for(int i=1;i<=n;i++) fl[i]=(ll)fl[i-1]*i%mod;
	nf[n]=ni(fl[n]);for(int i=n-1;i>=0;i--) nf[i]=(ll)nf[i+1]*(i+1)%mod;
	for(int i=1;i<=n;i++) Ni[i]=(ll)fl[i-1]*nf[i]%mod;
	
	for(int i=1;i<=K;i++) f[i]=Ni[n];
	int Sum=0;
	for(int i=1;i<=n;i++){
		if(i-K-1>=1) Sum=(Sum-(ll)f[i-K-1]*Ni[n-(i-K-1)]%mod+mod)%mod;
		f[i]=(f[i]+Sum)%mod;
		Sum=(Sum+(ll)f[i]*Ni[n-i])%mod;
	}
	
	printf("%d\n",(ll)f[n]*fl[n]%mod);
	
//	dfsdkfjsdklfjklsdjf
	
	return 0;
}