#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);++i)
using ll = long long;
constexpr ll INF = 1LL << 60;
constexpr int MOD = 998244353;

ll q, a, b, c;

int main() {
  cin.tie(0); ios_base::sync_with_stdio(false);
  cin >> q;
  while(q--) {
    cin >> a >> b >> c;
    ll ans = b;
    a -= a % c;
    while(a) {
      while(a % c == 0) a /= c, ans += b;
      if(a <= (c-1)*2) ans += (a + c - 2) / (c - 1) * b, a = 0;
      else if(a % c) a -= a % c, ans += b;
    }
    cout << ans << '\n';
  }
  return 0;
}