#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;

ll modpow(ll a, ll e, ll m){
    ll r = 1;
    while (e){
        if (e&1) r = r*a%m;
        a = a*a%m;
        e >>= 1;
    }
    return r;
}

int main(){
    ll N, P;
    cin >> N >> P;

    ll e = 0;
    for (ll n = P; n <= N; ){
        e += N/n;
        if (n > N/P) break;
        n *= P;
    }

    cout << modpow(P, e, MOD) << endl;
}