#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int mod=998244353;

ll fac[200005];
ll inv[200005];
ll invf[200005];

ll modcomb(int n,int r){
  if(n<r)return 0ll;
  return fac[n]*invf[r]%mod*invf[n-r]%mod;
}


int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  fac[0]=inv[0]=invf[0]=1;
  fac[1]=inv[1]=invf[1]=1;
  for(int i=2;i<200005;i++){
    fac[i]=fac[i-1]*i%mod;
    inv[i]=inv[mod%i]*(mod-mod/i)%mod;
    invf[i]=invf[i-1]*inv[i]%mod;
  }
  int N,P;
  cin>>N>>P;
  ll ans=fac[N];
  ll t=1;
  for(int i=0;i<=N/P;i++){
    ans=(ans-t*invf[i])%mod;
    if(P<=N)t=t*fac[P-1]%mod;
    if(P<=N)t=t*modcomb(N-P*i,P)%mod;
  }
  if(ans<0)ans+=mod;
  cout<<ans<<'\n';
}