#include <bits/stdc++.h>
using namespace std;
int mpow(int base, int exp);
void ipgraph(long long n, long long m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
vector<long long> g[N];
double calc(long long x, double h, double c) {
  return ((c + h) * x + h) / (2 * x + 1);
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  ;
  long long t, i, x, j, k, p, q, y, u, v, n, m;
  cin >> x;
  while (x--) {
    double h, c, t;
    cin >> h >> c >> t;
    if (t <= (h + c) / 2) {
      cout << 2 << "\n";
      continue;
    }
    long long l = 0, r = 1e9;
    while (l < r) {
      long long mid = (l + r) / 2;
      double val = calc(mid, h, c);
      if (val < t)
        r = mid;
      else
        l = mid + 1;
    }
    if (l == 0) {
      cout << "1\n";
    } else if (t - calc(l, h, c) < calc(l - 1, h, c) - t)
      cout << 2 * l + 1 << "\n";
    else
      cout << 2 * l - 1 << "\n";
  }
  return 0;
}
int mpow(int base, int exp) {
  base %= mod;
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((long long)result * base) % mod;
    base = ((long long)base * base) % mod;
    exp >>= 1;
  }
  return result;
}
void ipgraph(long long n, long long m) {
  int i, u, v;
  while (m--) {
    cin >> u >> v;
    g[u - 1].push_back(v - 1);
    g[v - 1].push_back(u - 1);
  }
}
void dfs(int u, int par) {
  for (int v : g[u]) {
    if (v == par) continue;
    dfs(v, u);
  }
}
