#include <bits/stdc++.h>
#define ll long long
#define Ma 10000005
#define mod 998244353
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;


ll mul[Ma],pre[Ma];

ll n,k;


ll po(ll p,ll x=mod-2)
{
	ll sum=1;
	while (x)
	{
		if (x&1) sum=sum*p%mod;
		p=p*p%mod;
		x>>=1;
	}
	return sum;
}



ll dp[Ma],sum[Ma];

void sol()
{
	cin>>n>>k;
	mul[0]=1;
	for (ll i=1;i<=n;i++)
		mul[i]=mul[i-1]*i%mod;
	pre[n]=po(mul[n]);
	for (ll i=n-1;i>=0;i--)
		pre[i]=pre[i+1]*(i+1)%mod;

	for (ll i=1;i<=k;i++)
	{
		dp[i]=mul[i];
		sum[i]=(sum[i-1]+dp[i]*pre[i])%mod;
	}
	for (ll i=k+1;i<=n;i++)
	{
		dp[i]=(sum[i-1]-sum[i-k-1]+mod)%mod*mul[i-1]%mod;
		sum[i]=(sum[i-1]+dp[i]*pre[i])%mod;
	}
	printf("%lld\n",dp[n]);
}


int main()
{
	IOS
	ll tt=1;
	//cin>>tt;
	while (tt--)
		sol();
	return 0;
}