/*
Problem : E. The Journey of Geor Autumn
Url : https://codeforces.com/gym/102900/problem/E
Date : 2024/10/11 02:06:43
Solver : pmt2018
*/

#include<bits/stdc++.h>

#define y0 pmtx
#define y1 pmtxx
#define x0 pmtxxx
#define x1 pmtxxxx
#define pb push_back
#define mp make_pair
#define fi first 
#define se second
#define lowbit(x) (x&(-x))

#define DEBUG printf("Passing Line %d in function [%s].\n",__LINE__,__FUNCTION__)

using namespace std;

typedef pair<int ,int > pii;
typedef vector<int > vi;
typedef long long ll;
typedef unsigned long long ull;

namespace FastIO{
    const int SIZE=(1<<20);
    char in[SIZE],*inS=in,*inT=in+SIZE;
    inline char Getchar(){
        if(inS==inT){inT=(inS=in)+fread(in,1,SIZE,stdin);if(inS==inT)return EOF;}
        return *inS++;
    }
    char out[SIZE],*outS=out,*outT=out+SIZE;
    inline void Flush(){fwrite(out,1,outS-out,stdout);outS=out;}
    inline void Putchar(char c){*outS++=c;if(outS==outT)Flush();}
    struct NTR{~NTR(){Flush();}}ZTR;
}

#ifndef LOCAL
    #define getchar FastIO::Getchar
    #define putchar FastIO::Putchar 
#endif

template<typename T> inline void read(T &x){
    x=0;int f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
    x*=f;
}

inline void readstr(char* str){
    int len=0;char c=getchar();
    while(c==' '||c=='\n')c=getchar();
    while(c!=' '&&c!='\n'&&c!='\r')str[len++]=c,c=getchar();
    str[len] = '\0';
}

template<typename T>inline void write(T x){
    if(!x)putchar('0');
    if(x<0)x=-x,putchar('-');
    static int sta[20];int tot=0;
    while(x)sta[tot++]=x%10,x/=10;
    while(tot)putchar(sta[--tot]+48);
}

inline void writestr(char* str){int cur=0;while(str[cur])putchar(str[cur++]);}

const int maxn=10000007,INF=0x3f3f3f3f;
const ll MOD=998244353;
const ll LINF=0x3f3f3f3f3f3f3f3fll;
const ll P=19260817;

template<typename T>inline void ckmax(T &x,T y){x=(y>x?y:x);}
template<typename T>inline void ckmin(T &x,T y){x=(y<x?y:x);}
template<typename T>inline T my_abs(T x){if(x<0)x=-x;return x;}
inline int mod1(int x){return x<MOD?x:x-MOD;}
inline int mod2(int x){return x<0?x+MOD:x;}
inline void add(int &x,int y){x=mod1(x+y);}
inline void sub(int &x,int y){x=mod2(x-y);}

int n,k;
int frac[maxn], ifrac[maxn];

int qpow(int a,int b){
    int ret = 1;
    while(b){
        if(b&1)ret=1ll*ret*a%MOD;
        a=1ll*a*a%MOD;
        b>>=1;
    }
    return ret;
}
void init() {
    frac[0]=1;
    for(int i=1;i<=n;i++){
        frac[i]=1ll*i*frac[i-1]%MOD;
    }
    ifrac[n]=qpow(frac[n], MOD-2);
    for(int i=n;i>=1;i--){
        ifrac[i-1]=1ll*ifrac[i]*i%MOD;
    }
}

int dp[maxn], sum[maxn];
int main(){
    read(n), read(k);
    init();
    dp[n]=1;
    sum[n]=1;
    for(int i=n-1;i>=1;i--){
        dp[i] = 1ll*mod2(sum[i+1]-sum[min(n+1,i+k+1)])*frac[n-i-1]%MOD;
        sum[i] = mod1(sum[i+1]+1ll*dp[i]*ifrac[n-i]%MOD);
    }
    int ans=0;
    for(int i=1;i<=k;i++){
        add(ans, 1ll*dp[i]*frac[n-1]%MOD*ifrac[n-i]%MOD);
    }
    write(ans);
    return 0;
}

//things to remember
//1.long long
//2.array length
//3.freopen
//4 boarder case