#include <bits/stdc++.h>
using namespace std;
bool sortinrev(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.first > b.first);
}
long long power(long long x, unsigned long long y) {
  long long p = 998244353;
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
void solve() {
  long long h, c, t;
  cin >> h >> c >> t;
  if (h == t) {
    cout << "1"
         << "\n";
    return;
  }
  if (h + c >= 2 * t) {
    cout << "2"
         << "\n";
    return;
  }
  long long p = t - c;
  long long l = (2 * t) - h - c;
  long long p1 = (2 * p) - l;
  long long high;
  if (p1 % l == 0)
    high = p1 / l;
  else
    high = (p1 / l) + 1;
  if (high % 2 == 0) high += 1;
  long long low = high - 2;
  double temp1 = (((low / 2) * (h + c)) + h) / (low * 1.0);
  double temp2 = (((high / 2) * (h + c)) + h) / (high * 1.0);
  if (abs(temp2 - t) > abs(t - temp1))
    cout << low << "\n";
  else if (abs(temp2 - t) == abs(t - temp1))
    cout << low << "\n";
  else
    cout << high << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
