#include #include #include using namespace std; using bigint = boost::multiprecision::cpp_int; constexpr int lg = 40; constexpr long long mod = 998244353; bool is_big(long long a, long long b, long long c, long long d){ if(a * d > b * c){ return true; } return false; } void solve(){ long long a, b, c; cin >> a >> b >> c; vector v(lg, 0); bigint state = 1; for(int i = 0; i < lg; i++){ if(i > 0){ v[i] = v[i - 1]; } while(state % c == 0){ state /= c; v[i]++; } state *= a; } if(v[lg - 1] == 0){ cout << 0 << "\n"; return; } int arg = 1; for(int i = 2; i < lg; i++){ if(is_big(v[i], i, v[arg], arg)){ arg = i; } } cout << ((v[arg] * b) / arg) % mod << "\n"; } int main(){ int t; cin >> t; while(t--){ solve(); } }