#include <bits/stdc++.h>
#pragma warning(disable : 4996)
const int maxn = 1e5 + 5;
const double Inf = 10000.0;
const double PI = acos(-1.0);
using namespace std;
double h, c, t;
double a;
double f1(int x) { return ((x)*h + (x - 1) * c) / (1.0 * (2 * x - 1)); }
double f2(int x) { return ((x - 1) * h + (x)*c) / (1.0 * (2 * x - 1)); }
int b_1() {
  int l = 1, r = 0x3f3f3f3f;
  while (l < r) {
    int mid = (l + r) / 2;
    if (f1(mid) > t)
      l = mid + 1;
    else
      r = mid;
  }
  double del1 = fabs(t - f1(l));
  double del2;
  l == 1 ? del2 = 0x3f3f3f3f : del2 = fabs(t - f1(l - 1));
  double del3 = fabs(t - a);
  if (del3 <= del1 && del3 <= del2) return 2;
  if (del1 < del2)
    return 2 * l - 1;
  else
    return 2 * l - 3;
}
int b_2() {
  int l = 1, r = 0x3f3f3f3f;
  while (l < r) {
    int mid = (l + r + 1) / 2;
    if (f2(mid) < t)
      l = mid;
    else
      r = mid - 1;
  }
  double del1 = fabs(t - f1(l));
  double del2;
  del2 = fabs(t - f1(l + 1));
  double del3 = fabs(t - a);
  if (del3 <= del1 && del3 <= del2) return 2;
  if (del1 < del2)
    return 2 * l - 1;
  else
    return 2 * l + 1;
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    scanf("%lf%lf%lf", &h, &c, &t);
    a = (h + c) / 2;
    if ((fabs(a - t) < 1e-8) && (fabs(h - t) < 1e-8))
      puts("1");
    else if ((fabs(a - t) < 1e-8))
      puts("2");
    else if (t > a) {
      printf("%d\n", b_1());
    } else
      printf("%d\n", b_2());
  }
}
