#include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int cas;
  cin >> cas;
  while (cas--) {
    int h, t, c;
    cin >> h >> c >> t;
    h -= c;
    t -= c;
    if (h >= 2 * t) {
      cout << 2 << endl;
    } else {
      LL n = (h - t) / (2 * t - h);
      auto f = [](LL n, int h, int t) {
        return (n + 1) * (2 * n + 3) * h + (2 * n + 1) * (n + 2) * h >
               (2 * n + 1) * (2 * n + 3) * t * 2;
      };
      if (f(n, h, t)) ++n;
      cout << 2 * n + 1 << endl;
    }
  }
  return 0;
}
