//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <type_traits>

using namespace std;

#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}

using LL = long long;

//------------------------------------------
//------------------------------------------


int main() {

    int Q;
    cin >> Q;

    while (Q--) {
        LL A, B, C;
        cin >> A >> B >> C;

        string ans = "";
        LL cnt = 1;
        while (A != 0) {
            if (A > C && A <= 2 * C) {
                cnt += 2;
                if (A != 2 * C)cnt++;
                break;
            }
            if (A % C == 0) ans += '0';
            else ans += '1';
            A /= C;
        }
        reverse(ans.begin(), ans.end());
        for (int i = 1; i < ans.size(); i++) {
            if (ans[i] != '0')cnt++;
            cnt++;
        }
        cout << cnt * B << endl;
    }

    return 0;
}