#include using namespace std; using ll=long long; using pii=pair; #define all(a) a.begin(),a.end() #define pb push_back #define sz(a) ((int)a.size()) const int N=200005,mod=998244353; int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;} int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;} int mul(int x, int y){return ((ll)x)*y%mod;} int Pow(int x, ll y=mod-2){int res=1; for(; y; x=mul(x,x),y>>=1) if(y&1) res=mul(res,x); return res;} int fac[N],inv[N],ifac[N]; inline int C(int n, int m){if(m<0||m>n) return 0; return mul(fac[n],mul(ifac[m],ifac[n-m]));} void init_comb(){ fac[0]=inv[1]=ifac[0]=1; for(int i=1; i> n >> p; dp[0]=1; for(int i=1; i<=n; ++i){ dp[i]=dp[i-1]; if(i>=p) dp[i]=add(dp[i],mul(dp[i-p],mul(fac[i-1],ifac[i-p]))); } cout << sub(fac[n],dp[n]) << "\n"; }