#include <iostream>
#include <iomanip>
#include <cstring>
#include <algorithm> 
#include <math.h>
#include <queue>
#include <functional>
#include <map>
#include <vector>
#include <string>
#include <set> 
using namespace std;

typedef long long ll;
typedef pair<ll, int> P;
typedef pair<pair<int, int>, int> PP;

const ll INF = 1e15;
const int MAX = 510000;
const ll MOD = 1000000007;

int main(void) {	
	int Q; cin >> Q;
	for (int i = 0; i < Q; i++) {
		ll A, B, C; cin >> A >> B >> C;
		ll ans = 0;
		while (A != 0) {
			if (C <= A && A <= 2 * C - 2) {
				ans += 2 * B;
				break;
			}
			else if (A%C != 0) {
				A -= A % C; ans += B;
			}
			else {
				A /= C; ans += B;
			}
		}
		cout << ans << endl;
	}
}