#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

int a, b, c;

int solve(map<int, int> &mp, int a, int cnt) {
  if (a < 0) return INF;
  if (cnt == 40) return inf;
  if (a == 0) return 0;
  if (mp[a] != 0) return mp[a];
  int mo = a % c;
  int mi;
  if (mo != 0) {
    mi = solve(mp, a - mo, cnt + 1);
  }
  else {
    mi = solve(mp, a / c, cnt + 1);
  }
  if (mo != c - 1) {
    chmin(mi, solve(mp, a - (c - 1), cnt + 1));
  }
  mp[a] = mi + 1;
  return mi + 1;
}

int solve2(int a, int c) {
  int ans = 0;
  while (a > 0) {
    ans++;
    if (a % c == 0) {
      a /= c;
    }
    else {
      a -= a % c;
    }
  }
  return ans;
}

signed main() {
  fio();
  int q;
  cin >> q;
  while (q--) {
    cin >> a >> b >> c;
    //*
    map<int, int> mp;
    ll ans = solve(mp, a, 0);
    /*
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
      DEBUG(*itr);
    }
    //*/
    ans = ans * b;
    //*/
    //ll ans = solve2(a, c) * b;
    cout << ans << endl;
  }
}