#include <bits/stdc++.h>
#define mk make_pair
#define pb emplace_back
#define fi first
#define se second
#define pii pair<int, int>
#define fore(i, u, v) for (int i = h[u], v = e[i].v; i; v = e[i = e[i].nxt].v)
#define all(x) x.begin(), x.end()
#define int long long

using namespace std;
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (! isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }
	while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); }
	return x * f;
}

const int maxn = 1e7 + 10, P = 998244353;

int n, k, f[maxn], inv[maxn], fin[maxn], fac[maxn];
void init() {
	for (int i : {0, 1}) inv[i] = fac[i] = fin[i] = 1;
	for (int i = 2; i < maxn; i ++)
		inv[i] = inv[P % i] * (P - P / i) % P,
		fin[i] = fin[i - 1] * inv[i] % P, fac[i] = fac[i - 1] * i % P;
}

signed main() {

	n = read(), k = read(), init();
	for (int i = n; i >= n - k; i --) f[i] = fac[n - i];

	int sum = 0;
	for (int i = n - k; i <= n - 1; i ++) (sum += f[i] * fin[n - i] % P) %= P;
	for (int i = n - k - 1; i >= 0; i --) {
		f[i] = sum * fac[n - i - 1] % P;
		(sum += f[i] * fin[n - i] % P - f[i + k] * fin[n - i - k] % P + P) %= P;
	}

	cout << f[0];

	return 0;
}