#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll N,P;
const ll mo=998244353;

const int NUM_=2000003;
static ll fact[NUM_+1],factr[NUM_+1],inv[NUM_+1];


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>P;
	
	
	inv[1]=fact[0]=factr[0]=1;
	for (int i=2;i<P;++i) inv[i] = inv[P % i] * (P - P / i) % P;
	for (int i=1;i<P;++i) fact[i]=fact[i-1]*i%P, factr[i]=factr[i-1]*inv[i]%P;
	
	
	ll ret=0;
	FOR(i,P) {
		if(i>N) continue;
		ll num=(N+1)/P;
		if(i<(N+1)%P) num++;
		
		ll sum=0;
		ll a=N;
		while(a>=P) sum+=a/P, a/=P;
		a=N-i;
		while(a>=P) sum-=a/P, a/=P;
		if(sum) continue;
		
		a=fact[N%P]%P*factr[i]%P*factr[(N-i)%P]%P;
		ret+=num%mo*a%mo;
		
	}
	cout<<ret%mo<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}