#include<bits/stdc++.h>
using namespace std;
const int N = 1e7+7;
typedef long long LL;
using namespace std;
const int p = 998244353;

int fac[N], ifac[N];
LL fst(LL b, int k) {
  LL res = 1;
  while(k > 0) {
    if(k & 1) res = res * b % p;
    k >>= 1;
    b = b * b % p;
  } return res;
}

void init() {
  fac[0] = 1;
  const int M = 1e7;
  for(int i = 1; i <= M; i++) fac[i] = 1ll * fac[i - 1] * i % p;
  ifac[M] = fst(fac[M], p - 2);
  for(int i = M - 1; i >= 0; i--) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % p;
}

int inv(int x) {
  return 1ll * fac[x - 1] * ifac[x] % p;
}

LL f[N], g[N];

int main() {
  int n, k;
  cin >> n >> k;
  init();
  if(n < k) cout << fac[n];
  else {
    for(int i = 1; i <= k; i++) {
      f[i] = fac[i];
      g[i] = (g[i - 1] + 1ll * f[i] * ifac[i] % p) % p;
    }
    for(int i = k + 1; i <= n; i++) {
      f[i] = (g[i - 1] * fac[i - 1] % p) % p;
      g[i] = g[i - 1] + f[i] * ifac[i] % p - f[i - k] * ifac[i - k] % p;
      g[i] = (g[i] % p + p) % p;
    } 
    cout << f[n];
  }
return 0;
}