#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll,ll> P;
#define _for(x,y,z) for (int x(y),_(z); x<=_; ++x)
#define _rep(x,y,z) for (int x(y),_(z); x>=_; --x)
inline ll read(){ ll x; cin>>x; return x; }
inline void _init(){
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
}

ll a, b, c;

inline ll _ceil(ll a, ll b) {
	return a / b + !!(a % b);
}

void init() {}
void procedure() {
	cin >> a >> b >> c;
	if (a > b) {
		swap(a, b);
	}
	if (a >= c) {
		cout << _ceil((a + b) << 1, c) << "\n";
		return;
	}
	if (b < c) {
		if (a + b == c) {
			cout << "2\n";
		} else if ((a << 1) == c || (b << 1) == c) {
			cout << "3\n";
		} else {
			cout << "4\n";
		}
		return;
	}
	if ((a << 1) == c) {
		cout << 1 + _ceil((b << 1), c) << "\n";
		return;
	}
	a = c - a;
	ll ans = _ceil(b << 1, c);
	ll t = b - a;
	if (t >= 0) {
		ans = min(ans, _ceil(b + t, c));
	}
	t = b - (a << 1);
	if (t >= 0) {
		ans = min(ans, _ceil(b + t, c));
	}
	t = b - a;
	if (t >= c) {
		ans = min(ans, _ceil(t << 1, c));
	} else {
		if ((t << 1) == c) {
			ans = min(ans, 1ll);
		} else {
			ans = min(ans, 2ll);
		}
	}
	cout << ans + 2 << "\n";
}

int main() {
	_init(), init();
	int T=read();
	while(T--) procedure();
	return 0;
}