#include <bits/stdc++.h>
using namespace std;

long long pow2(long long b, long long n, long long mod){
    if(n == 0) return 1LL;
    if(n == 1) return b;
    long long bn = pow2(b,n/2LL,mod);
    if(n % 2 == 0){
        return (bn*bn)%mod;
    }else{
        return (bn*bn)%mod*b%mod;
    }
}

int main(void){
    long long N;
    long long P;
    long long mod = 998244353LL;
    long long ans = 0;
    cin >> N >> P;
    long long nowP = P;
    long long count = 0;
    while(nowP <= N){
        count += N / nowP;
        nowP *= P;
    }
    ans = pow2(P,count,mod);
    ans %= mod;
    cout << ans << "\n";
}