#include <bits/stdc++.h>
using namespace std;
vector<long long int> pr;
void SieveOfEratosthenes() {
  long long int n = 1000000;
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (long long int p = 2; p <= n; p++)
    if (prime[p]) pr.push_back(p);
}
void solve() {
  long double h, c, t;
  cin >> h >> c >> t;
  if (t == h) {
    cout << "1" << endl;
    return;
  }
  long double ans = (long double)(h + c) / (2.0);
  if (ans >= t) {
    cout << "2" << endl;
    return;
  }
  long double xx = (long double)((long double)(c - t) / (h + c - 2 * t));
  long double xx1 = floor(xx);
  long double xx2 = ceil(xx);
  long double a1, a2;
  a1 = (long double)((h * ceil(xx1)) + (c * (ceil(xx1) - 1))) /
       (long double)(2 * ceil(xx1) - 1);
  a2 = (long double)((h * ceil(xx2)) + (c * (ceil(xx2) - 1))) /
       (long double)(2 * ceil(xx2) - 1);
  if (abs(a1 - t) <= abs(ans - t)) {
    if (abs(a1 - t) <= abs(a2 - t))
      cout << 2 * ceil(xx1) - 1 << endl;
    else
      cout << 2 * ceil(xx2) - 1 << endl;
  } else if (abs(a2 - t) > abs(ans - t))
    cout << "2" << endl;
  else
    cout << 2 * ceil(xx2) - 1 << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  cin >> t;
  while (t) {
    solve();
    t--;
  }
}
