#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#define mems(x, v) memset(x, v, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef long double wisdom;

const int N = 1e7 + 5, mod = 998244353;
int qpow(int x, int y) {int ans = 1; while (y) {if (y & 1) ans = 1ll * ans * x % mod; x = 1ll * x * x % mod; y >>= 1;} return ans;}
int dp[N], qwq[N], fac[N], invf[N];
int main() {
	//freopen("b.in", "r", stdin); freopen("b.out", "w", stdout);
	int n, k; cin >> n >> k, dp[0] = fac[0] = invf[0] = 1;
	for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
	invf[n] = qpow(fac[n], mod - 2); for (int i = n - 1; i; i--) invf[i] = 1ll * invf[i + 1] * (i + 1) % mod;

	// for (int i = 1; i <= n; i++) for (int j = max(0, i - k); j < i; j++)
	// 	dp[i] = (dp[i] + 1ll * fac[n - j - 1] * invf[n - i] % mod * dp[j]) % mod;

	qwq[0] = fac[n - 1];
	for (int i = 1; i <= n; i++)
		dp[i] = 1ll * (qwq[i - 1] - (i <= k ? 0 : qwq[i - k - 1]) + mod) * invf[n - i] % mod, qwq[i] = (qwq[i - 1] + 1ll * dp[i] * fac[n - i - 1]) % mod;
	cout << dp[n];
	return 0;
}