#include<cstdio>
#include<iostream>
#define RI register int
#define CI const int&
using namespace std;
const int N=1e7+5,mod=998244353;
int n,k,g[N],sg[N],fact[N],ifac[N],inv[N];
inline int quick_pow(int x,int p=mod-2,int mul=1)
{
    for (;p;p>>=1,x=1LL*x*x%mod) if (p&1) mul=1LL*mul*x%mod; return mul;
}
inline void init(CI n)
{
    fact[0]=1; for (RI i=1;i<=n;++i) fact[i]=1LL*fact[i-1]*i%mod;
    ifac[n]=quick_pow(fact[n]); for (RI i=n-1;i>=0;--i) ifac[i]=1LL*ifac[i+1]*(i+1)%mod;
    inv[0]=1; for (RI i=1;i<=n;++i) inv[i]=1LL*ifac[i]*fact[i-1]%mod;
}
int main()
{
    scanf("%d%d",&n,&k); init(n);
    for (RI i=1;i<=k;++i) g[i]=1,sg[i]=(sg[i-1]+g[i])%mod;
    for (RI i=k+1;i<=n;++i)
    {
        g[i]=1LL*(sg[i-1]-sg[i-k-1]+mod)*inv[i]%mod;
        sg[i]=(sg[i-1]+g[i])%mod;
    }
    return printf("%d",1LL*g[n]*fact[n]%mod),0;
}