#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template <typename T>
using v2 = vector<vector<T>>;
template <typename T>
inline v2<T> fill(int r, int c, T t) {
  return v2<T>(r, vector<T>(c, t));
}
int h, c, t;
ll calc(int n) { return (ll)h * (n + 1) + (ll)c * n; }
void solve() {
  cin >> h >> c >> t;
  if (t >= h) {
    cout << "1\n";
  } else if (2 * t <= h + c) {
    cout << "2\n";
  } else {
    int lo = 0;
    int hi = 1e9;
    int ans = -1;
    while (lo <= hi) {
      int mid = (lo + hi) / 2;
      if ((ll)(mid + 1) * h + (ll)mid * c >= (ll)t * (2 * mid + 1)) {
        ans = mid;
        lo = mid + 1;
      } else {
        hi = mid - 1;
      }
    }
    int a = 2 * ans + 1;
    int b = 2 * (ans + 1) + 1;
    ll e = abs((ll)t * a - calc(ans));
    ll f = abs((ll)t * b - calc(ans + 1));
    if (e * b <= f * a) {
      cout << a << '\n';
    } else {
      cout << b << '\n';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
