#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using mint = atcoder::modint998244353;

// combination MOD
const int MOD=998244353;
const int MAX_N=2e5;
vector<mint> fac(MAX_N+1,1);
vector<ll> finv(MAX_N+1,1);
vector<ll> inv(MAX_N+1,1);
void comb_setup(){
	for(int i=2;i<=MAX_N;i++){
		fac.at(i)=(fac.at(i-1)*i);
		inv.at(i)=MOD-(inv.at(MOD%i)*(MOD/i))%MOD;
		finv.at(i)=(finv.at(i-1)*inv.at(i))%MOD;
	}
}
mint comb(int n,int k){
	if(n<k) return 0;
	return fac.at(n)*finv.at(n-k)*finv.at(k);
}

int main(){
	comb_setup();
	int n,p;
	cin>>n>>p;
	mint ans=fac.at(n);
	for(ll i=0;i*p<=n;i++){
		mint tmp=comb(n,i*p);
		tmp*=fac.at(i*p);
		tmp/=fac.at(p).pow(i);
		tmp/=fac.at(i);
		tmp*=fac.at(p-1).pow(i);
		ans-=tmp;
	}
	cout<<ans.val()<<endl;
}