#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int s;

bool check(vector < int > v) {
	sort(v.begin(), v.end());
	do {
		bool can = true;
		int lst = -1;
		for(int i = 1;i < (int)v.size();i++) {
			if(v[i] / s == lst) can = false;
			lst = v[i] / s;
		}
		if(can) return true;
	} while(next_permutation(v.begin(), v.end()));
	return false;
}

void solve() {
	int a, b;
	scanf("%d%d%d", &a, &b, &s);
	if(a > b) swap(a, b);
	if(a + b < s) {
		printf("4\n");
		return;
	}
	int bar = 2 * ((a + b + s - 1) / s);
	int naj = (2 * (a + b) + s - 1) / s;
	int vis = (2 * (a + b)) % s;
	if(vis == a || vis == b) {
		printf("%d\n", naj);
		return;
	}
	if(b > vis && check({a, a, b, b - vis})) {
		printf("%d\n", naj);
		return;
	}
	if(a > vis && check({a - vis, a, b, b})) {
		printf("%d\n", naj);
		return;
	}
	printf("%d\n", bar);
}

int main() {
	int T; scanf("%d", &T);
	for(;T--;) solve();
	return 0;
}