//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize("Ofast","unroll-loops","inline")
#include<bits/stdc++.h>
#define ll long long
//#define int ll
#define pb push_back
#define pii pair<int,int>
#define MP make_pair
#define fi first
#define se second
using namespace std;
const int N=1e7+60,M=1e6+20,mod=998244353;
inline void Add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline void Del(int &x,int y){x-=y;if(x<0) x+=mod;}
inline int del(int x,int y){x-=y;return x<0?x+mod:x;}
inline int add(int x,int y){x+=y;return x>=mod?x-mod:x;}
int inv[N],n,k,f[N],g[N];
signed main(){
//	freopen("b.in","r",stdin);
//	freopen("b.out","w",stdout);
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	inv[0]=inv[1]=1;for(int i=2;i<N;i++) inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
	cin>>n>>k;
	f[0]=g[0]=1;
	for(int i=1;i<=n;i++){
		int x=del(g[i-1],i-k-1>=0?g[i-k-1]:0);
		f[i]=1ll*x*inv[i]%mod;
		g[i]=add(g[i-1],f[i]);
	}
	int ans=f[n];
	for(int i=1;i<=n;i++) ans=1ll*ans*i%mod;
	cout<<ans<<'\n';
	return 0;
}