#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf=1e18;
int solve(int a,int b,int c)
{
	if(a==0&&b==0) return 0;
    if(a+a==c) return 1+1+(b+b!=c);
	if(a==0) return 1+(b+b!=c);
	if(b==0) return 1+(a+a!=c);
	int less=c-a;
	if(b<less) return 4;
	if(b==less) return 2;
	if(b<less+less) return 4;
	if(b==less+less) return 3;
	if(b==(c-b)+less+less) return 3;
	return 4;
}
int solve2(int a,int b,int c)
{
	int less=c-b;
	if(less+less==a) return 3;
	return inf;
}
int solve3(int a,int b,int c)
{
	int less=c-b+c-b+c-a%c;
	if(less==a) return 3;
	return inf;
}
int solve4(int a,int b,int c)
{
	int less=c-b;
	if(less+less>=a||a-less-less>=c) return inf;
	int lesss=a-less-less;
	if(a-lesss<0) return inf;
	if(a-lesss==0) return 3;
	return 4;
}
int solve5(int a,int b,int c)
{
	int less=c-b;
	if(less+less>=a||a-less-less>=c) return inf;
	int lesss=a-less-less;
	if(a-c-lesss>c) return inf;
	return 4;
}
void solve()
{
	int x,y,c,ans=0;
	cin>>x>>y>>c;
	int a=x%c,b=y%c;
	ans=2*(x/c+y/c)+min(solve(a,b,c),solve(b,a,c));
	if(a+c<=x) ans=min(ans,2*(x/c+y/c)-1+solve2(a+c,b,c));
	if(b+c<=y) ans=min(ans,2*(x/c+y/c)-1+solve2(b+c,a,c));
	if(a+2*c<=x) ans=min(ans,2*(x/c+y/c)-2+solve3(a+2*c,b,c));
	if(b+2*c<=y) ans=min(ans,2*(x/c+y/c)-2+solve3(b+2*c,a,c));
	if(a+c<=x) ans=min(ans,2*(x/c+y/c)-2+solve4(a+c,b,c));
	if(b+c<=y) ans=min(ans,2*(x/c+y/c)-2+solve4(a+c,b,c));
	if(a+2*c<=x) ans=min(ans,2*(x/c+y/c)-3+solve5(a+2*c,b,c));
	if(b+2*c<=y) ans=min(ans,2*(x/c+y/c)-3+solve5(b+2*c,a,c));
	cout<<ans<<"\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int t;
	cin>>t;
	while(t--) solve();
}