#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;

int main() {
    int q;
    cin >> q;
    rep(query, q) {
        ll a, b, c;
        cin >> a >> b >> c;
        if(c == 1) {
            assert(false);
            cout << -1 << endl;
            continue;
        }
        bool bb = false;
        ll ans = 0;
        while(a > 1) {
            if(a % c) {
                ans++;
                bb = true;
            } else bb = false;
            a /= c;
            if(a) ans++;
        }
        if(a == 1 && !bb) ans++;
        cout << ans * b << endl;
    }
    return 0;
}