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

ll modpow(ll a, ll x)
{
    ll ret = 1;
    a %= MOD;
    while (x > 0)
    {
        if (x % 2 == 1)
        {
            ret = ret * a % MOD;
        }
        a = a * a % MOD;
        x >>= 1;
    }
    return ret;
}

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

    ll cnt = 0;
    for (ll p = P; p <= N; p *= P)
    {
        cnt += N / p;
    }

    cout << modpow(P, cnt) << endl;
}