#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int tt;
long long h, c, t;
long long k, a, b;
int main() {
  scanf("%d", &tt);
  while (tt--) {
    scanf("%lld%lld%lld", &h, &c, &t);
    if (t <= (h + c) / 2)
      puts("2\n");
    else {
      k = (h - t) / (2 * t - h - c);
      a = abs(k * (h + c) + h - t * (2 * k + 1)) * (2 * k + 3);
      b = abs(((k + 1) * (h + c) + h) - t * (2 * k + 3)) * (2 * k + 1);
      if (a > b) k++;
      printf("%lld\n", k * 2 + 1);
    }
  }
}
