#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}

map<tuple<ll,ll,ll>,ll> m;

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	ll x,y,a;
	cin>>x>>y>>a;
	ll ans=abs(x-y);
	ll c=0,tmp=1,b=0;
	auto f=[&](auto self,ll R,ll C)->ll{
		if(C==0) return R;
		if(m.count({a,R,C})) return m[{a,R,C}];
		ll S=R%a;
		ll A=S+self(self,R/a,C-1);
		ll B=a-S+self(self,R/a+1,C-1);
		m[{a,R,C}]=min(A,B);
		return min(A,B);
	};
	while(ans>b){
		tmp=1;
		c=0;
		chmin(ans,b+abs(x-y));
		while(x<y&&ans>b+c+1){
			c++;
			tmp*=a;
			if(tmp>=2e9) break;
			ll val=f(f,abs(x*tmp-y),c);
			chmin(ans,val+c+b);
			//if(val+c+b==3) cout<<a<<" "<<c<<" "<<b<<endl;
		}
		if(x==0) break;
		b++;
		x/=a;
	}
	cout<<ans<<"\n";
}