#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MAXN 10000005
const int MOD(998244353);

int n, k;
int f[MAXN], s[MAXN], fac[MAXN], ifac[MAXN];

int qpow(int x, int k=MOD-2){int res(1); for (; k; k>>=1, (x*=x)%=MOD) if (k&1) (res*=x)%=MOD; return res;}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	
	cin >> n >> k; f[0] = s[0] = 1;
	fac[0] = 1; for (int i(1); i<=n; ++i) fac[i] = fac[i-1]*i % MOD;
	ifac[n] = qpow(fac[n]); for (int i(n-1); i; --i) ifac[i] = ifac[i+1]*(i+1) % MOD;
	for (int i(1); i<=n; ++i) f[i] = fac[i-1]*(s[i-1]-(i <= k ? 0 : s[i-min(i, k)-1])+MOD)%MOD, s[i] = (s[i-1]+f[i]*ifac[i]) % MOD;
	cout << f[n];
	
	return 0;
}