#include <bits/stdc++.h>
const int mod = 1000000007;
const long long INF = 9000000000000000000;
using namespace std;
void solve() {
  double lb, ub, temp, x, y;
  cin >> ub >> lb >> temp;
  double H, L, mid;
  H = ub, L = (lb + ub) / 2;
  mid = (ub + ub + lb) / 3;
  if (temp >= H)
    cout << 1 << endl;
  else if (temp <= L)
    cout << 2 << endl;
  else {
    int k = (temp - lb) / (2 * temp - lb - ub);
    int k1 = k + 1;
    double temp1 = (k * ub + (k - 1) * lb) / (2 * k - 1);
    double temp2 = (k1 * ub + (k1 - 1) * lb) / (2 * k1 - 1);
    if (abs(temp1 - temp) <= abs(temp2 - temp)) {
      cout << 2 * k - 1 << endl;
    } else
      cout << 2 * k1 - 1 << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long q = 1;
  cin >> q;
  while (q--) {
    solve();
  }
  return 0;
}
