#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <ctime>
#include <cstdio>
#include <random>
#include <vector>
#include <bitset>
#include <cassert>
#include <cstring>
#include <algorithm>
#define fi first
#define se second
#define MISAKA main
#define ll long long
#define eb emplace_back
#define pii pair<int,int>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define _rep(i,a,b) for(int i=(a);i>=(b);--i)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define FIO(FILE) freopen(FILE".in","r",stdin),freopen(FILE".out","w",stdout)
using namespace std;
inline int read(){
    char ch=getchar();int f=1,x=0;
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    return x*f;
}
const int N=1e7+10,mod=998244353;
int n,k;ll f[N],g[N],fac=1,inv[N];
ll qp(ll a,ll b){ll r=1;for(;b;b>>=1,a=a*a%mod)if(b&1)r=r*a%mod;return r;}
void misaka(){
    n=read(),k=read();
    f[0]=inv[1]=1;
    rep(i,2,n) (fac*=i)%=mod,inv[i]=inv[mod%i]*(mod-mod/i)%mod;
    g[0]=inv[n];
    rep(i,1,n){
        f[i]=(g[i-1]-(i-k>0?g[i-k-1]:0)+mod)%mod;
        g[i]=(g[i-1]+f[i]*inv[n-i])%mod;
    }
    printf("%lld",fac*f[n]%mod);
}
signed MISAKA(){
    // FIO("b");
    int T=1;
    while(T--) misaka();
    return 0;
}