#include 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 bool chmax(T &a, const T &b) { if(a 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; inv[1]=fact[0]=factr[0]=1; for (int i=2;i<=NUM_;++i) inv[i] = inv[mo % i] * (mo - mo / i) % mo; for (int i=1;i<=NUM_;++i) fact[i]=fact[i-1]*i%mo, factr[i]=factr[i-1]*inv[i]%mo; cin>>N>>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=i; while(a>=P) sum-=a/P, a/=P; a=N-i; while(a>=P) sum-=a/P, a/=P; if(sum) continue; a=num%mo*fact[N%P]%mo*factr[i]%mo*factr[(N-i)%P]%mo; if(N/P%2) a=mo-a; if((N-i)/P%2) a=mo-a; ret+=a; } cout<