#pragma region Macros #include #include #if defined(LOCAL) || defined(_DEBUG) #include "debug.hpp" #else #define O(...) #define START() #define STOP() #define MEMORY() #endif using namespace std; #define REP(i, n) for(int i=0, i##_len=(n); i=0; --i) #define FOR(i, n, m) for(int i=(m), i##_len=(n); ibool chmax(T &a, const U &b) { if (a<(T)b) { a=(T)b; return 1; } return 0; } templatebool chmin(T &a, const U &b) { if (b<(T)a) { a=(T)b; return 1; } return 0; } #define vec vector #define umap unordered_map #define uset unordered_set using ll = long long; using ld = long double; using P = pair; using Tup = tuple; using vl = vec; #define fi first #define se second #define el endl constexpr ll INF = numeric_limits::max()/2-1; template istream &operator>>(istream &stream, vec& o){REP(i, o.size())stream >> o[i];return stream;} #define I(T, ...) ;T __VA_ARGS__;__i(__VA_ARGS__); void __i() {} template void __i(T&& o, Ts&&... args){cin >> o;__i(forward(args)...);} #pragma endregion void Main(); int main(){ std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(15); Main(); MEMORY(); return 0; } ll dpow(ll x, ll n, int mod = __INT_MAX__) { long long ret = 1; while (n > 0) { if (n & 1) ret = ret * x % mod; x = x * x % mod; n >>= 1; } return ret; } void Main(){ I(ll, n, p); ll bnb = p; ll cnt = 0; while(1) { ll t = n / bnb; if(t == 0) break; cnt += t; bnb *= p; } O(cnt); cout << dpow(p, cnt, 998244353) << el; }