#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;

const int MAX=410000;
const int MOD=998244353;
ll fac[MAX],finv[MAX],inv[MAX];

void init(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%MOD;
    inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
    finv[i]=finv[i-1]*inv[i]%MOD;
  }
}

ll nCr(int n,int k){
  if(n<k) return 0;
  if(n<0 || k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}

vector<ll> A;
map<pair<ll,ll>,ll> m;
ll f(ll x,ll c){
  if(c==0) return m[{x,c}]=1;
  ll sum=0,tmp=1;
  for(ll i=0;i*A[c]<=x;i++){
    if(i) sum=(sum+f(x-i*A[c],c-1)*tmp%MOD)%MOD;
    tmp=tmp*nCr(x-i*A[c],A[c])%MOD*fac[A[c]-1]%MOD*inv[i+1]%MOD;
  }
  return m[{x,c}]=sum;
}
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  init();
  ll n,p;
  cin>>n>>p;
  ll t=1,c=0;
  A.push_back(1);
  while(t*p<=n){
    t*=p;
    A.push_back(t);
    c++;
  }
  cout<<max(0LL,(fac[n]-f(n,c)+MOD)%MOD-1)<<endl;
  
  return 0;
}