#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
void solve() {
  long long h, c, t;
  cin >> h >> c >> t;
  double ans = h - t;
  long long taken = 1;
  if (abs((h + c + 0.0) / 2 - t) <= ans) {
    ans = abs((h + c + 0.0) / 2 - t);
    taken = 2;
  }
  double y = (h - t + 0.0) / (2 * t - (h + c));
  if (y >= 0) {
    long long x = (int)y;
    if (abs(((x + 1) * h + x * c + 0.0) / (2 * x + 1) - t) <= ans) {
      ans = abs(((x + 1) * h + x * c + 0.0) / (2 * x + 1) - t);
      taken = 2 * x + 1;
    }
    ++x;
    if (abs(((x + 1) * h + x * c + 0.0) / (2 * x + 1) - t) <= ans) {
      ans = abs(((x + 1) * h + x * c + 0.0) / (2 * x + 1) - t);
      taken = 2 * x + 1;
    }
    --x;
    if (abs(((x + 1) * h + x * c + 0.0) / (2 * x + 1) - t) <= ans) {
      ans = abs(((x + 1) * h + x * c + 0.0) / (2 * x + 1) - t);
      taken = 2 * x + 1;
    }
  }
  cout << taken << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
