#include <bits/stdc++.h>
#define _for(i, a, b)  for (int i = (a); i <= (b); i ++ )
#define _all(i, a, b)  for (int i = (a); i >= (b); i -- )
#define ll long long
using namespace std;
const int N = 1e7 + 5, P = 998244353;
int n, k; ll fac[N], inv[N], s[N], f[N];
inline void Mul(ll & x, ll y) { (x *= y) %= P; }
inline ll pw(ll a, int b) {
	ll res = 1;
	while (b) {
		if (b & 1)  Mul(res, a);
		Mul(a, a), b >>= 1;
	}
	return res;
}
inline ll calc(int l, int r) {
	if (l > r)  return 0;
	return l ? (s[r] - s[l - 1] + P) % P : s[r];
}
int main() {
	ios :: sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> n >> k, fac[0] = inv[0] = f[0] = s[0] = 1;
	_for (i, 1, n)  fac[i] = fac[i - 1] * i % P;
	inv[n] = pw(fac[n], P - 2);
	_all (i, n - 1, 1)  inv[i] = inv[i + 1] * (i + 1) % P;
	_for (i, 1, n)  f[i] = 1ll * fac[i - 1] * calc(i - min(k, i), i - 1) % P, s[i] = (s[i - 1] + f[i] * inv[i] % P) % P;
	return cout << f[n] << "\n", 0;
}