#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pll pair<int,int>
#define fi first
#define se second
typedef long long LL;
typedef unsigned long long ull;
typedef long double ld;
int n,m,k;
const int N=1e3+10,M=5e3,mod=998244353,inf=1e18;
const double eps=1e-8;
int  res,cnt;
int dp[N],sum[N];

int fac[N],ifa[N];

int qpow(int a,int b)
{
	int res=1;
	while(b)
	{
		if(b&1) res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}

void ini()
{
	fac[0]=1;
	for(int i=1;i<=n;i++) fac[i]=fac[i-1]*i%mod;
	ifa[n]=qpow(fac[n],mod-2);
	for(int i=n-1;i>=0;i--)
	{
		ifa[i]=ifa[i+1]*(i+1)%mod;
	}
}

void solve() {
    cin>>n>>k;
    ini();
    dp[0]=1;
    sum[0]=dp[0];
    for(int i=1;i<=n;i++)
    {
    	if(i-1>=k)
    	{
			dp[i]=(sum[i-1]-sum[i-1-k]+mod)%mod;
		}
		else dp[i]=sum[i-1];
		dp[i]=dp[i]*fac[i-1]%mod;
		sum[i]=(sum[i-1]+dp[i]*ifa[i]%mod)%mod;
	}
	cout<<dp[n]<<endl;
}


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T=1;
    //cin>>T;
    while(T--)solve();
    return 0;
}
/*
1
17 8
*/