#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

ll naive(ll x, ll y, ll a){
    map<ll, ll> dist;
    map<ll, ll> pre;
    queue<ll> que;
    auto push = [&](ll v, ll d, ll prev_value){
        if(dist.count(v)) return;
        dist[v] = d;
        pre[v] = prev_value;
        que.push(v);
    };
    push(x, 0, -1);
    while(true){
        ll v = que.front(); que.pop();
        ll d = dist[v];
        if(v == y) break;
        push(v+1, d+1, v);
        if(v > 0) push(v-1, d+1, v);
        push(v/a, d+1, v);
        push(v*a, d+1, v);
    }
    vector<ll> path;
    ll cur = y;
    while(cur != -1){
        path.push_back(cur);
        cur = pre[cur];
    }
    reverse(path.begin(), path.end());
    // print_vector(path);
    return dist[y];
}

const ll inf = 4e18;

// 割り算以外を使って最小何回か
ll sub_solve(ll x, ll y, ll a){
    int cnt = 0;
    ll l = y, r = y;
    ll ans = abs(y-x);
    ll cl = 0, cr = 0;
    while(true){
        chmin(ans, cl+abs(l-x));
        chmin(ans, cr+abs(r-x));
        if(l == 0){
            break;
        }
        ll l0 = l/a;
        ll r0 = l0+1;
        ll l0a = l0*a;
        ll r0a = r0*a;
        ll cl0 = min(abs(l-l0a)+cl, abs(r-l0a)+cr)+1;
        ll cr0 = min(abs(l-r0a)+cl, abs(r-r0a)+cr)+1;
        cl = min(cl0, cr0+1);
        cr = min(cr0, cl0+1);
        l = l0;
        r = r0;
        // cout << l0a << ' ' << r0a << endl;
        // cout << l << ' ' << r << ':' << cl << ' ' << cr << endl;
    }
    // cout << x << "->" << y << ' ' << ans << endl;
    return ans;
}

ll solve(ll x, ll y, ll a){
    ll cnt_devide = 0;
    ll ans = abs(y-x);
    ll xx = x;
    while(xx > 0){
        chmin(ans, cnt_devide+sub_solve(xx, y, a));
        cnt_devide++;
        xx /= a;
    }
    return ans;
}

void test(int a){
    for(int x = 1; x <= 30; x++){
        for(int y = 1; y <= 30; y++){
            ll a0 = naive(x, y, a);
            ll a1 = solve(x, y, a);
            if(a0 == a1) continue;
            cout << x << "->" << y << ":" << a0 << ' ' << a1 << endl;
            // naive(x, y, a);
        }
        debug_value(x)
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    // cout << sub_solve(1, 24, 3) << endl;
    // int a; cin >> a;
    // test(a);
    int t; cin >> t;
    while(t--){
        ll x, y, a; cin >> x >> y >> a;
        cout << solve(x, y, a) << endl;
    }
}