#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000008, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

ll a, b, c;

void solve() {
    map<ll, ll> ma, mb;
    for (ll i = 2; i * i <= a; i++) {
        while (a % i == 0) ma[i] += b, a /= i;
    }
    if (a != 1) ma[a] += b;
    for (ll i = 2; i * i <= c; i++) {
        while (c % i == 0) mb[i]++, c /= i;
    }
    if (c != 1) mb[c]++;
    res = 1e18;
    for (auto [x, y] : mb) {
        if (!ma.count(x)) res = 0;
        else res = min(res, ma[x] / y);
    }
    printf("%lld\n", res % MOD);
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        scanf("%lld%lld%lld", &a, &b, &c);
        solve();
    }
    return 0;
}