#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e7+100,mod=998244353;
int fac[maxn],inv[maxn],f[maxn];
int qpow(int x,int y) {
	ll ret=1,bas=x;
	while (y) {
		if (y&1) ret=ret*bas%mod;
		bas=bas*bas%mod;
		y>>=1;
	}
	return ret;
}
int main() {
	fac[0]=1;
	for (int i=1;i<maxn;i++) fac[i]=1ll*fac[i-1]*i%mod;
	int INV=qpow(fac[maxn-1],mod-2);
	for (int i=maxn-1;i>=1;i--) {
		inv[i]=1ll*fac[i-1]*INV%mod;
		INV=1ll*INV*i%mod;
	}
	int n,k;
	cin>>n>>k;
	for (int i=1;i<=k;i++) f[i]=1;
	for (int i=k+1,sum=k;i<=n;i++) {
		f[i]=1ll*sum*inv[i]%mod;
		sum=(0ll+sum+f[i]-f[i-k]+mod)%mod;
	}
	cout<<1ll*f[n]*fac[n]%mod;
}