#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long MOD = 998244353;
const long long inf = 1e18;
const long long MAX = 2e5 + 1;
inline long long add(long long a, long long b) {
  return ((a % mod) + (b % mod)) % mod;
}
inline long long sub(long long a, long long b) {
  return ((a % mod) - (b % mod) + mod) % mod;
}
inline long long mul(long long a, long long b) {
  return ((a % mod) * (b % mod)) % mod;
}
vector<long long> fac(1e6);
long long pwr(long long x, long long n) {
  x = x % mod;
  if (!n) return 1;
  if (n & 1)
    return mul(x, pwr(mul(x, x), (n - 1) / 2));
  else
    return pwr(mul(x, x), n / 2);
}
long long modinv(long long n) { return pwr(n, mod - 2); }
long long inv(long long i) {
  if (i == 1) return 1;
  return (MOD - (MOD / i) * inv(MOD % i) % MOD) % MOD;
}
long long ncr(long long n, long long r) {
  long long ans = 1;
  if (r != 0 && r != n) {
    ans = fac[n] * modinv(fac[r]) % MOD * modinv(fac[n - r]) % MOD;
  }
  return ans;
}
void pre() {
  fac[0] = 1;
  for (int i = 1; i < (int)fac.size(); i++) {
    fac[i] = (fac[i - 1] * i) % MOD;
  }
}
void solve() {
  long double h, c, t;
  cin >> h >> c >> t;
  vector<pair<long double, long double>> p;
  if (h == t)
    cout << 1 << endl;
  else if ((c + h) >= 2 * t)
    cout << 2 << endl;
  else {
    long long x = (long long)(abs(t - c) / abs(-h - c + 2 * t));
    long double first = (x * h + (x - 1) * c) / (1.0 * (2 * x - 1));
    long long y = x + 1;
    long double second = (y * h + (y - 1) * c) / (1.0 * (2 * y - 1));
    p.push_back({abs(t - first), x});
    p.push_back({abs(t - second), x + 1});
    sort(p.begin(), p.end());
    cout << (2 * p[0].second) - 1 << endl;
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
