//#include #include using namespace std; typedef long long ll; typedef pair p; const int INF = 1e9; const ll LINF = ll(1e18) + 1; const int MOD = 1000000007; const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}; const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; #define yes cout << "Yes" << endl #define YES cout << "YES" << endl #define no cout << "No" << endl #define NO cout << "NO" << endl #define rep(i, n) for (int i = 0; i < n; i++) #define ALL(v) v.begin(), v.end() #define debug(v) \ cout << #v << ":"; \ for (auto x : v) \ { \ cout << x << ' '; \ } \ cout << endl; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } //cout< ans; int main() { cin.tie(0); ios::sync_with_stdio(false); int q; cin >> q; while (q--) { ll a, b, c; cin >> a >> b >> c; ll res = 0; if (c == 1) { res = -1; } else { while (a) { if (a <= (c - 1)) { a = 0; res += b; } else if (a <= (c - 1) * 2) { a = 0; res += 2 * b; } else if (a % c) { a -= a % c; res += b; } else { a /= c; res += b; } } } ans.push_back(res); } rep(i, ans.size()) cout << ans[i] << "\n"; }