#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define int long long
#define endl '\n'
int n,m,k;
const int mod=998244353;
int fac[10000010],inv[10000010],ifac[1000010];
int ksm(int x,int y,int mod)
{
	int ans=1,res=x;
	while(y)
	{
		if(y&1) ans=ans*res%mod;
		res=res*res%mod;
		y>>=1;
	}
	return ans;
}
int dp[10000010],pre[10000010];
signed main()
{
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>k;
	fac[0]=1;
	rep(i,1,n) fac[i]=fac[i-1]*i%mod;
	ifac[n]=ksm(fac[n],mod-2,mod);
	for(int i=n-1;i>=0;i--) ifac[i]=ifac[i+1]*(i+1)%mod;
	inv[0]=1;
	rep(i,1,n) inv[i]=fac[i-1]*ifac[i]%mod;
	rep(i,1,k) dp[i]=1,pre[i]=pre[i-1]+dp[i];
	rep(i,k+1,n)
	{
		//cout<<inv[i]<<endl;
		dp[i]=(pre[i-1]-pre[i-k-1]+mod)*inv[i]%mod;
        pre[i]=(pre[i-1]+dp[i])%mod;
	}
//	cout<<dp[n]<<endl;
	rep(i,1,n) dp[n]*=i,dp[n]%=mod;
	cout<<dp[n];
}