#include<bits/stdc++.h>
using namespace std;
int main()
{
  int t;
  cin>>t;
  int i=0;
  while(i<t)
  {
    int h,c,t;
    cin>>h>>c>>t;
    double a = (c-t)/(double)((c+h) -2*t);
    if(c+h == 2*t)
    {
      cout<<2<<endl;
    }
    else
    {
      double a1 = ceil(a);
      double a2 = floor(a);
      cout<<"a1:"<<a1<<" ,a2:"<<a2<<endl;
      double ans1 = abs((((h+c)*a1 - c)/(double)(2*a1 - 1)) - (t));
      double ans2 = abs((((h+c)*a2 - c)/(double)(2*a2 - 1)) - (t));
      int ans = (int) ans1>=ans2?2*a2-1:2*a1-1;
      cout<<ans<<endl;
    }
    i++;
  }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
  int t;
  cin>>t;
  int i=0;
  while(i<t)
  {
    int h,c,t;
    cin>>h>>c>>t;
    double a = (c-t)/(double)((c+h) -2*t);
    if(c+h == 2*t)
    {
      cout<<2<<endl;
    }
    else
    {
      double a1 = ceil(a);
      double a2 = floor(a);
      double ans1 = abs((((h+c)*a1 - c)/(double)(2*a1 - 1)) - (t));
      double ans2 = abs((((h+c)*a2 - c)/(double)(2*a2 - 1)) - (t));
      int ans = (int) ans1>=ans2?2*a2-1:2*a1-1;
      cout<<ans<<endl;
    }
    i++;
  }
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
  int t;
  cin>>t;
  int i=0;
  while(i<t)
  {
    int h,c,t;
    cin>>h>>c>>t;
    double a = (c-t)/(double)((c+h) -2*t);
    if((c+h) >= 2*t)
    {
      cout<<2<<endl;
    }
    else
    {
      double a1 = ceil(a);
      double a2 = floor(a);
      double x1 = (((h+c)*a1 - c)/(double)(2*a1 - 1));
      double x2 = (((h+c)*a2 - c)/(double)(2*a2 - 1));
      double ans1 = abs(x1-t);
      double ans2 = abs(x2-t);
      int ans = (int) ans1>=ans2?2*a2 -1:2*a1 -1;
      cout<<ans<<endl;
    }
    i++;
  }
}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int t;
	cin>>t;
	for(int i=1; i<=t; i++){
		long long h,c,t;
		cin>>h>>c>>t;
		if(i==5121) cout<<h<<"*"<<c<<"*"<<t<<'\n';

		if(2*t<=(h+c)) cout<<2<<'\n';
		else if(t>=h) cout<<1<<'\n';
		else{
			long long mindiff = abs(t-h);
			long long mindiff_down = 1;

			long long mincup = 1;
			long long l=1,r=100000000;
			while(l<r){
				long long mid = (l+r)/2;
				if(mid%2==0) mid++;
				long long hot = mid/2+1;
				long long cold = mid/2;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mincup = mid;
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
				}

				if(hot*h+cold*c==t*(hot+cold)){
					mincup = mid;
					break;
				}
				else if(hot*h+cold*c<t*(hot+cold)) r = mid-1;
				else l = mid+1;
			}
			cout<<mincup<<'\n';
		}
	}
}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int t;
	cin>>t;
	while(t--){
		long long h,c,t;
		cin>>h>>c>>t;
		if(2*t<=(h+c)) cout<<2<<'\n';
		else if(t>=h) cout<<1<<'\n';
		else{
			long long mindiff = abs(t-h);
			long long mindiff_down = 1;

			long long mincup = 1;
			long long l=1,r=100000000;
			while(l<r){
				long long mid = (l+r)/2;
				if(mid%2==0) mid++;
				long long hot = mid/2+1;
				long long cold = mid/2;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mincup = mid;
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
				}

				if(hot*h+cold*c==t*(hot+cold)){
					mincup = mid;
					break;
				}
				else if(hot*h+cold*c<t*(hot+cold)) r = mid-1;
				else l = mid+1;
			}
			cout<<mincup<<'\n';
		}
	}
}


#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
long double positive(long double n){
	if(n<0) n*=-1;
	return n;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin>>t;
	while(t--){
		long double hot,cold,t;
		cin>>hot>>cold>>t;
		long double avg = (hot+cold)/2;
		if(avg>=t){ //��տ��� ���ߴ�  ���� �Ұ����ϹǷ� ��պ��� �۴ٸ�
			cout<<2<<'\n';
		}
		else{
			if(t == hot) cout<<1<<'\n';
			else{
				bool decreasing = true;
				long double mindiff = 1000000;
				for(int i=1;decreasing; i+=1){
					long double bt = (hot*i+cold*i+hot)/(2*i+1);

					long double diff = positive(t-bt);
				//	cout<<i<<" "<<bt<<" "<<diff<<'\n';
					if(diff<mindiff){
						mindiff = diff;
					}
					else{
						cout<<2*(i-1)+1<<'\n';
						break;
					}
				}
			}
		}
	}
}


#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
long double positive(long double n){
	if(n<0) n*=-1;
	return n;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin>>t;
	while(t--){
		long double hot,cold,t;
		cin>>hot>>cold>>t;
		long double avg = (hot+cold)/2;
		if(avg>=t){ //��տ��� ���ߴ�  ���� �Ұ����ϹǷ� ��պ��� �۴ٸ�
			cout<<2<<'\n';
		}
		else{
			if(t == hot) cout<<1<<'\n';
			else{
				int start=1;
				int fin = 1000000;
				long double mindiff = 1000000;
				int mincup;

				while(start<fin){
					int mid = (start+fin)/2;
					long double bt = (hot*mid+cold*mid+hot)/(2*mid+1);
					if(bt>t) start=mid+1;
					else fin = mid;
					if(mindiff>positive(t-bt)){
						mindiff = positive(t-bt);
						mincup = mid;
					}
				}
				if(hot-t<mindiff) cout<<1<<'\n';
				else cout<<2*mincup+1<<'\n';
			}
		}
	}
}


#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
long double positive(long double n){
	if(n<0) n*=-1;
	return n;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin>>t;
	while(t--){
		long double hot,cold,t;
		cin>>hot>>cold>>t;
		long double avg = (hot+cold)/2;
		if(avg>=t){ //��տ��� ���ߴ�  ���� �Ұ����ϹǷ� ��պ��� �۴ٸ�
			cout<<2<<'\n';
		}
		else{
			if(t == hot) cout<<1<<'\n';
			else{
				int start=1;
				int fin = 1000000;
				long double mindiff = 1000000;
				int mincup;

				while(start<fin){
					int mid = (start+fin)/2;
					long double bt = (hot*mid+cold*mid+hot)/(2*mid+1);
					if(bt>t) start=mid+1;
					else fin = mid;
					if(mindiff>positive(t-bt)){
						mindiff = positive(t-bt);
						mincup = mid;
					}
				}
				cout<<2*mincup+1<<'\n';
			}
		}
	}
}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int t;
	cin>>t;
	for(int i=1; i<=t; i++){
		long long h,c,t;
		cin>>h>>c>>t;
		if(2*t<=(h+c)) cout<<2<<'\n';
		else if(t>=h) cout<<1<<'\n';
		else{
			long long mindiff = abs(t-h);
			long long mindiff_down = 1;

			long long mincup = 1;
			long long l=1,r=100000;
			while(l<r){
				long long mid = (l+r)/2;
				if(mid%2==0) mid++;
				long long hot = mid/2+1;
				long long cold = mid/2;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mincup = mid;
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
				}

				if(hot*h+cold*c==t*(hot+cold)){
					mincup = mid;
					break;
				}
				else if(hot*h+cold*c<t*(hot+cold)) r = mid-1;
				else l = mid+1;
			}
			for(long long j=mincup+10; j>=mincup-10; j--){
				if(j<=1) break;
				long long cold = j/2;
				long long hot = j-cold;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
					mincup = j;
				}
			}
			cout<<mincup<<'\n';
		}
	}
}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int t;
	cin>>t;
	for(int i=1; i<=t; i++){
		long long h,c,t;
		cin>>h>>c>>t;
		if(2*t<=(h+c)) cout<<2<<'\n';
		else if(t>=h) cout<<1<<'\n';
		else{
			long long mindiff = abs(t-h);
			long long mindiff_down = 1;

			long long mincup = 1;
			long long l=1,r=100000;
			while(l<r){
				long long mid = (l+r)/2;
					cout<<l<<" "<<r<<" "<<mid<<'\n';
				if(mid%2==0) mid++;
				long long hot = mid/2+1;
				long long cold = mid/2;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mincup = mid;
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
				}

				if(hot*h+cold*c==t*(hot+cold)){
					mincup = mid;
					break;
				}
				else if(hot*h+cold*c<t*(hot+cold)) r = mid-1;
				else l = mid+1;
			}
			for(long long j=mincup+10; j>=mincup-10; j--){
				if(j<=1) break;
				long long cold = j/2;
				long long hot = j-cold;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
					mincup = j;
				}
			}
			cout<<mincup<<'\n';
		}
	}
}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int t;
	cin>>t;
	for(int i=1; i<=t; i++){
		long long h,c,t;
		cin>>h>>c>>t;
		if(2*t<=(h+c)) cout<<2<<'\n';
		else if(t>=h) cout<<1<<'\n';
		else{
			long long mindiff = abs(t-h);
			long long mindiff_down = 1;

			long long mincup = 1;
			long long l=1,r=100000000;
			while(l<r){
				long long mid = (l+r)/2;
				if(mid%2==0) mid++;
				long long hot = mid/2+1;
				long long cold = mid/2;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mincup = mid;
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
				}

				if(hot*h+cold*c==t*(hot+cold)){
					mincup = mid;
					break;
				}
				else if(hot*h+cold*c<t*(hot+cold)) r = mid-1;
				else l = mid+1;
			}
			for(long long j=mincup+10; j>=mincup-10; j--){
				if(j<=1) break;
				long long cold = j/2;
				long long hot = j-cold;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
					mincup = j;
				}
			}
			cout<<mincup<<'\n';
		}
	}
}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int t;
	cin>>t;
	for(int i=1; i<=t; i++){
		long long h,c,t;
		cin>>h>>c>>t;
		if(2*t<=(h+c)) cout<<2<<'\n';
		else if(t>=h) cout<<1<<'\n';
		else{
			long long mindiff = abs(t-h);
			long long mindiff_down = 1;

			long long mincup = 1;
			long long l=1,r=1000000;
			while(l<r){
				long long mid = (l+r)/2;
				if(mid%2==0) mid++;
				long long hot = mid/2+1;
				long long cold = mid/2;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mincup = mid;
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
				}

				if(hot*h+cold*c==t*(hot+cold)){
					mincup = mid;
					break;
				}
				else if(hot*h+cold*c<t*(hot+cold)) r = mid-1;
				else l = mid+1;
			}
			for(long long j=mincup+10; j>=mincup-10; j--){
				if(j<=1) break;
				long long cold = j/2;
				long long hot = j-cold;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
					mincup = j;
				}
			}
			cout<<mincup<<'\n';
		}
	}
}


#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
long double positive(long double n){
	if(n<0) n*=-1;
	return n;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin>>t;
	while(t--){
		long double hot,cold,t;
		cin>>hot>>cold>>t;
		long double avg = (hot+cold)/2;
		if(avg>=t){ //평균에서 낮추는  것은 불가능하므로 평균보다 작다면
			cout<<2<<'\n';
		}
		else{
			if(t == hot) cout<<1<<'\n';
			else{
				int start=1;
				int fin = 1000000;
				long double mindiff = 1000000;
				int mincup;

				while(start<fin){
					int mid = (start+fin)/2;
					long double bt = (hot*mid+cold*mid+hot)/(2*mid+1);
					if(bt>t) start=mid+1;
					else fin = mid;
					if(mindiff>positive(t-bt)){
						mindiff = positive(t-bt);
						mincup = mid;
					}
				}
				if(hot-t<mindiff) cout<<1<<'\n';
				else if(t-(hot*(mincup+1)+cold*(mincup+1))/(2*(mincup+1)+1)<mindiff) cout<<2*(mincup+1)+1<<'\n';
				else cout<<2*mincup+1<<'\n';
			}
		}
	}
}


#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
long double positive(long double n){
	if(n<0) n*=-1;
	return n;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin>>t;
	while(t--){
		long double hot,cold,t;
		cin>>hot>>cold>>t;
		long double avg = (hot+cold)/2;
		if(avg>=t){ //평균에서 낮추는  것은 불가능하므로 평균보다 작다면
			cout<<2<<'\n';
		}
		else{
			if(t == hot) cout<<1<<'\n';
			else{
				int start=1;
				int fin = 100000000;
				long double mindiff = 1000000;
				int mincup;

				while(start<fin){
					int mid = (start+fin)/2;
					long double bt = (hot*mid+cold*mid+hot)/(2*mid+1);
					if(bt>t) start=mid+1;
					else fin = mid;
					if(mindiff>positive(t-bt)){
						mindiff = positive(t-bt);
						mincup = mid;
					}
				}
				if(positive(hot-t)<mindiff) cout<<1<<'\n';
				else if(positive(t-(hot*(mincup+1)+cold*(mincup+1))/(2*(mincup+1)+1))<mindiff) cout<<2*(mincup+1)+1<<'\n';
				else cout<<2*mincup+1<<'\n';
			}
		}
	}
}


#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
long double positive(long double n){
	if(n<0) n*=-1;
	return n;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin>>t;
	while(t--){
		long double hot,cold,t;
		cin>>hot>>cold>>t;
		long double avg = (hot+cold)/2;
		if(avg>=t){ //��տ��� ���ߴ�  ���� �Ұ����ϹǷ� ��պ��� �۴ٸ�
			cout<<2<<'\n';
		}
		else{
			if(t == hot) cout<<1<<'\n';
			else{
				bool decreasing = true;
				int mincup;
				long double mindiff = 1000000;
				for(int i=1;i<10000; i+=1){
					long double bt = (hot*i+cold*i+hot)/(2*i+1);

					long double diff = positive(t-bt);
				//	cout<<i<<" "<<bt<<" "<<diff<<'\n';
					if(diff<mindiff){
						mindiff = diff;
						mincup = i;
					}
				}
				cout<<2*mincup+1<<'\n';
			}
		}
	}
}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int t;
	cin>>t;
	for(int i=1; i<=t; i++){
		long long h,c,t;
		cin>>h>>c>>t;
		if(2*t<=(h+c)) cout<<2<<'\n';
		else if(t>=h) cout<<1<<'\n';
		else{
			long long mindiff = abs(t-h);
			long long mindiff_down = 1;

			long long mincup = 1;
			long long l=1,r=1000000;
			while(l<r){
				long long mid = (l+r)/2;
				if(mid%2==0) mid++;
				long long hot = mid/2+1;
				long long cold = mid/2;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mincup = mid;
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
				}

				if(hot*h+cold*c==t*(hot+cold)){
					mincup = mid;
					break;
				}
				else if(hot*h+cold*c<t*(hot+cold)) r = mid;
				else l = mid+1;
			}
			for(long long j=mincup+10; j>=mincup-10; j--){
				if(j<=1) break;
				long long cold = j/2;
				long long hot = j-cold;
				if(abs((hot*h+c*cold)-t*(hot+cold))*mincup<mindiff*(hot+cold)){
					mindiff = abs((hot*h+c*cold)-t*(hot+cold));
					mincup = j;
				}
			}
			cout<<mincup<<'\n';
		}
	}
}


#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
long double positive(long double n){
	if(n<0) n*=-1;
	return n;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin>>t;
	while(t--){
		long double hot,cold,t;
		cin>>hot>>cold>>t;
		long double avg = (hot+cold)/2;
		if(avg>=t){ //��տ��� ���ߴ�  ���� �Ұ����ϹǷ� ��պ��� �۴ٸ�
			cout<<2<<'\n';
		}
		else{
			if(t == hot) cout<<1<<'\n';
			else{
				bool decreasing = true;
				int mincup;
				long double mindiff = 1000000;
				for(int i=1;i<100000; i+=1){
					long double bt = (hot*i+cold*i+hot)/(2*i+1);

					long double diff = positive(t-bt);
				//	cout<<i<<" "<<bt<<" "<<diff<<'\n';
					if(diff<mindiff){
						mindiff = diff;
						mincup = i;
					}
				}
				cout<<2*mincup+1<<'\n';
			}
		}
	}
}


#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
long double positive(long double n){
	if(n<0) n*=-1;
	return n;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin>>t;
	while(t--){
		long double hot,cold,t;
		cin>>hot>>cold>>t;
		long double avg = (hot+cold)/2;
		if(avg>=t){ //평균에서 낮추는  것은 불가능하므로 평균보다 작다면
			cout<<2<<'\n';
		}
		else{
			if(t == hot) cout<<1<<'\n';
			else{
				int start=1;
				int fin = 1000000;
				long double mindiff = 1000000;
				int mincup;

				while(start<fin){
					int mid = (start+fin)/2;
					long double bt = (hot*mid+cold*mid+hot)/(2*mid+1);
					if(bt>t) start=mid+1;
					else fin = mid;
					if(mindiff>positive(t-bt)){
						mindiff = positive(t-bt);
						mincup = mid;
					}
				}
				if(positive(hot-t)<mindiff) cout<<1<<'\n';
				else if(positive(t-(hot*(mincup+1)+cold*(mincup+1))/(2*(mincup+1)+1))<mindiff) cout<<2*(mincup+1)+1<<'\n';
				else cout<<2*mincup+1<<'\n';
			}
		}
	}
}


#include<bits/stdc++.h>
using namespace std;

int main(){
	int t;
	cin>>t;
	while(t--){
		long long h,c,t;
		cin>>h>>c>>t;
		if(2*t<=(h+c)) cout<<2<<'\n';
		else if(t>=h) cout<<1<<'\n';
		else{
			long long mindiff = abs(t-h);
			long long mincup = 1;
			long long l=1,r=100000000;
			while(l<r){
				long long mid = (l+r)/2;
				if(mid%2==0) mid++;
				long long hot = mid/2+1;
				long long cold = mid/2;
				if(abs((hot*h+c*cold)-t*(hot+cold))<mindiff*(hot+cold)){
					mincup = mid;
				}

				if(hot*h+cold*c==t*(hot+cold)){
					mincup = mid;
					break;
				}
				else if(hot*h+cold*c<t*(hot+cold)) r = mid-1;
				else l = mid+1;
			}
			cout<<mincup<<'\n';
		}
	}
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		int h, c, t;
		cin >> h >> c >> t;
		if (h + c == 2 * t)
		{
			cout << 2 << endl;
		}
		else
		{
			double t1 = (double(c) - double(t)) / (double(h) + double(c) - 2 * double(t));
			if (t1 <= 0)
			{
				cout << 2 << endl;
				continue;
			}
			int t2 = int(t1);

			double a2 = abs(t2 * double(h) + double(c) * (t2 - 1) - double(t) * (2 * t2 - 1));	 // t2
			double a3 = abs((t2 + 1) * double(h) + double(c) * (t2) - double(t) * (2 * t2 + 1)); // t2 + 1
			double a4 = min(a2, a3);
			int ans;

			if (a2 > a3)
				cout << 2 * t2 + 1 << endl;
			else
				cout << 2 * t2 - 1 << endl;
		}
	}
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		double h, c, t;
		cin >> h >> c >> t;
		if (h + c == 2 * t)
		{
			cout << 2 << endl;
		}
		else
		{
			double t1 = (double(c) - double(t)) / (double(h) + double(c) - 2 * double(t));
			if (t1 <= 0)
			{
				cout << 2 << endl;
				continue;
			}
			int t2 = int(t1);

			double a2 = abs(t2 * double(h) + double(c) * (t2 - 1) - double(t) * (2 * t2 - 1));	 // t2
			double a3 = abs((t2 + 1) * double(h) + double(c) * (t2) - double(t) * (2 * t2 + 1)); // t2 + 1
			double a4 = min(a2, a3);
			int ans;

			if (a2 > a3)
				cout << 2 * t2 + 1 << endl;
			else
				cout << 2 * t2 - 1 << endl;
		}
	}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;
 double   faa(double ans)
 {
     if(ans<0)
        return ans*double(-1);
     return ans;
 }
double ji(double zz)
{
    double ans=faa(x-((zz-1)/zz/2*(n+m)+n/zz));
  return ans;
}
int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1;
    double zz=ff+2;
    double zzz=ff-2;
    double ans1=ji(zz);
    double ans2=ji(zzz);
    double ans3=ji(ff);
    if(ans1<=ans2&&ans1<=ans3)
    {
        printf("%.f\n",zz);
        continue;
    }
   if(ans2<=ans1&&ans2<=ans3)
    {
        printf("%.f\n",zzz);
        continue;
    }
    if(ans3<=ans2&&ans3<=ans1)
    {
        printf("%.f\n",ff);
        continue;
    }
   }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double h,c,t;
double faa(double ans)
{
    if(ans<0)
        return ans*double(-1);
    return ans;
}
int main()
{

 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>h>>c>>t;
   double pin = (h+c)/2;
   long long m;
   m=(c-t)/(h+c-(2*t));
   if(m<=0)
cout<<"2"<<endl;
   else
   {
    double tb1=0,tb2=0,tb0=0;
    tb1=((m*h)+(c*m)-c)/((2*m)-1);
    tb2=(((m+1)*h)+(c*(m+1))-c)/((2*(m+1))-1);
    m=abs(tb1-t)>abs(tb2-t)?m+1:m;
    cout<<(2*m)-1<<endl;
    continue;
   }

}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;

int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1;
    double ans=1e9,temp;
  for(temp=ff-2;temp<=ff+2;temp+=2)
  {
      if(temp<0)
        continue;
        double temp2=(temp-1)/temp/2*(n+m)+n/temp;
        double temp3=x-temp2;
        temp3=fabs(temp3);
        if(ans>temp3)
            ans=temp3;
        else
            break;
  }
    printf("%.f\n",temp-2.0);
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       double temp1,temp2;
       temp1=n-x;
       if(n-x<0)
         temp1=x-n;
         temp2=x-(n+n+m)/3;
          if(x-(n+n+m)/3<0)
         temp1=(n+n+m)/3-x;
       if(temp2>=temp1)
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{
    float n,m,x;
   scanf("%f%f%f",&n,&m,&x);
   float pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    float ff = round((m-x)/(n+m-2*x)*2-1.0);
    printf("%.f\n",ff);
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       if(fabs(n-x)<fabs(x-(n+n+m)/3))
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;
 double   faa(double ans)
 {
     if(ans<0)
        return ans*double(-1);
     return ans;
 }
double ji(double zz)
{
    double ans=faa(x-((zz-1)/zz/2*(n+m)+n/zz));
  return ans;
}
int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1;
    double zz=ff+2;
    double zzz=ff-2;
    double ans1=ji(zz);
    double ans2=ji(zzz);
    double ans3=ji(ff);
    if(ans1<=ans2&&ans1<=ans3)
    {
        printf("%.f\n",zz);
        continue;
    }
   if(ans2<=ans1&&ans2<=ans3)
    {
        printf("%.f\n",zzz);
        continue;
    }
    if(ans3<=ans2&&ans3<=ans1)
    {
        printf("%.f\n",ff);
        continue;
    }
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       double temp1,temp2;
       temp1=n-x;
       if(n-x<0)
         temp1=x-n;
         temp2=x-(n+n+m)/3;
          if(x-(n+n+m)/3<0)
         temp1=(n+n+m)/3-x;
       if(temp2>=temp1)
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;

int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1.0;
    double ans=1e9,temp;
  for(temp=ff-2;temp<=ff+2;temp+=2)
  {
      if(temp<0)
        continue;
        double temp2=(temp-1)/temp/2*(n+m)+n/temp;
        double temp3=x-temp2;
        if(temp3<0)
            temp3=temp3*(-1.0);
        if(ans>temp3)
            ans=temp3;
        else
            break;
  }
    printf("%.f\n",temp-2.0);
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       double temp1,temp2;
       temp1=n-x;
       if(n-x<0)
         temp1=x-n;
         temp2=x-(n+n+m)/3;
          if(x-(n+n+m)/3<0)
         temp1=(n+n+m)/3-x;
       if(temp2>=temp1)
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    float n,m,x;
float ji(float zz)
{
    float ans=fabs(x-((zz-1)/zz/2*(n+m)+n/zz));
  return ans;
}
int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   scanf("%f%f%f",&n,&m,&x);
   float pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    float ff = round((m-x)/(n+m-2*x))*2-1;
    float zz=ff+2;
    float zzz=ff-2;
    float ans1=ji(zz);
    float ans2=ji(zzz);
    float ans3=ji(ff);
    if(ans1<=ans2&&ans1<=ans3)
    {
        printf("%.f\n",zz);
        continue;
    }
   if(ans2<=ans1&&ans2<=ans3)
    {
        printf("%.f\n",zzz);
        continue;
    }
    if(ans3<=ans2&&ans3<=ans1)
    {
        printf("%.f\n",ff);
        continue;
    }
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       if(fabs(n-x)<fabs(x-(n+n+m)/3))
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;
 double   faa(double ans)
 {
     if(ans<0)
        return ans*double(-1);
     return ans;
 }
double ji(double zz)
{
    double ans=faa(x-((zz-1)/zz/2*(n+m)+n/zz));
  return ans;
}
int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1;
    double zz=ff+2;
    double zzz=ff-2;
    double ans1=ji(zz);
    double ans2=ji(zzz);
    double ans3=ji(ff);
    if(ans1<=ans2&&ans1<=ans3)
    {
        printf("%.f\n",zz);
        continue;
    }
   if(ans2<=ans1&&ans2<=ans3)
    {
        printf("%.f\n",zzz);
        continue;
    }
    if(ans3<=ans2&&ans3<=ans1)
    {
        printf("%.f\n",ff);
        continue;
    }
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       if(faa(n-x)<faa(x-(n+n+m)/3))
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;

double ji(double zz)
{
    double ans=x-((zz-1)/zz/2*(n+m)+n/zz);
    if(ans<0)
        ans=ans*(-1.0);
  return ans;
}
int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1;
    double zz=ff+2;
    double zzz=ff-2;
    double ans1=ji(zz);
    double ans2=ji(zzz);
    double ans3=ji(ff);
    if(ans1<ans2&&ans1<ans3)
    {
        printf("%.f\n",zz);
        continue;
    }
    if(ans3<ans2&&ans3<ans1)
    {
        printf("%.f\n",ff);
        continue;
    }
   if(ans2<ans1&&ans2<ans3)
    {
        printf("%.f\n",zzz);
        continue;
    }
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       double temp1,temp2;
       temp1=n-x;
       if(n-x<0)
         temp1=x-n;
         temp2=x-(n+n+m)/3;
          if(x-(n+n+m)/3<0)
         temp1=(n+n+m)/3-x;
       if(temp2>=temp1)
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double h,c,t;
double faa(double ans)
{
    if(ans<0)
        return ans*double(-1);
    return ans;
}
int main()
{

 int z;
 scanf("%d",&z);
 for(int i=0;i<z;i++)
{

   cin>>h>>c>>t;
   double pin = (h+c)/2;
   long long m;
   m=(c-t)/(h+c-(2*t));
   if(m<=0)
cout<<"2"<<endl;
   else
   {
    double tb1=0,tb2=0,tb0=0;
    tb1=((m*h)+(c*m)-c)/((2*m)-1);
    tb2=(((m+1)*h)+(c*(m+1))-c)/((2*(m+1))-1);
    m=abs(tb1-t)>abs(tb2-t)?m+1:m;
    cout<<(2*m)-1<<endl;
   }

}
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		double h, c, t;
		cin >> h >> c >> t;
		if (fabs(h + c - 2 * t) <= 0.00001)
		{
			cout << 2 << endl;
		}
		else
		{
			int t1 = (c - t) / (h + c - 2 * t);
			if (fabs(t1) <= 0.0001)
			{
				cout << 2 << endl;
				continue;
			}
			double a1 = fabs((t1 * h) + (c * (t1 - 1)) - (2 * t1 - 1) * t);
			double a2 = fabs(((t1 + 1) * h) + (c * t1) - (2 * t1 + 1) * t);

			if (a1 > a2)
				cout << 2 * t1 + 1 << endl;
			else
				cout << 2 * t1 - 1 << endl;
		}
	}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;

int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1.0;
    double ans=1e9,temp;
  for(temp=ff-2;temp<=ff+2;temp+=2)
  {
      if(temp<0)
        continue;
        double temp2=(temp-1)/temp/2*(n+m)+n/temp;
        double temp3=x-temp2;
        temp3=fabs(temp3);
        if(ans>temp3)
            ans=temp3;
        else
            break;
  }
    printf("%.f\n",temp-2.0);
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       double temp1,temp2;
       temp1=n-x;
       if(n-x<0)
         temp1=x-n;
         temp2=x-(n+n+m)/3;
          if(x-(n+n+m)/3<0)
         temp1=(n+n+m)/3-x;
       if(temp2>=temp1)
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{
    float n,m,x;
   scanf("%f%f%f",&n,&m,&x);
   float pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
       float zz=4;
        float temp=(zz/(zz+1)*(n+m))/2+n/(zz+1);
       while(1)
       {
           zz*=2;
           float ff=(zz/(zz+1)*(n+m))/2+n/(zz+1);
            if(fabs(x-temp)<fabs(x-ff))
            {
                   break;
            }
            temp =ff;
       }
       float ans = fabs(x-temp);
       float j;
       for( j=zz/2;j<=zz;j+=2)
       {
             float ff=j/(j+1)*(n+m)/2+n/(j+1);
            if(ff-x<0)
                break;
       }
       if((j/(j+1)*(n+m)/2+n/(j+1)-x)>(x-((j-2)/(j-1)*(n+m)/2+n/(j-1))))
          {
              printf("%.0f\n",j+1);
          }
          else
            {
                printf("%.0f\n",j-1);
            }
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       if(fabs(n-x)<fabs(x-(n+n+m)/3))
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;
 double   faa(double ans)
 {
     if(ans<0)
        return ans*double(-1);
     return ans;
 }
double ji(double zz)
{
    double ans=faa(x-((zz-1)/zz/2*(n+m)+n/zz));
  return ans;
}

int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1;
    double ans=1e9,temp;
  for(temp=ff-2;temp<=ff+2;temp+=2)
  {
      if(temp<0)
        continue;
        double temp2=(temp-1)/temp/2*(n+m)+n/temp;
        double temp3=ji(temp);
        if(ans>temp3)
            ans=temp3;
        else
            break;
  }
    printf("%.f\n",temp-2.0);
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       double temp1,temp2;
       temp1=n-x;
       if(n-x<0)
         temp1=x-n;
         temp2=x-(n+n+m)/3;
          if(x-(n+n+m)/3<0)
         temp1=(n+n+m)/3-x;
       if(temp2>=temp1)
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;

int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1.0;
    double ans=1e9,temp;
  for(temp=ff-20;temp<=ff+20;temp+=2)
  {
      if(temp<0)
        continue;
        double temp2=(temp-1)/temp/2*(n+m)+n/temp;
        double temp3=x-temp2;
        if(temp3<0)
            temp3=temp3*(-1.0);
        if(ans>temp3)
            ans=temp3;
        else
            break;
  }
    printf("%.f\n",temp-2.0);
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       double temp1,temp2;
       temp1=n-x;
       if(n-x<0)
         temp1=x-n;
         temp2=x-(n+n+m)/3;
          if(x-(n+n+m)/3<0)
         temp1=(n+n+m)/3-x;
       if(temp2>=temp1)
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{
    float n,m,x;
   scanf("%f%f%f",&n,&m,&x);
   float pin = (n+m)/2;
   if(x>pin&&(n+(n+m))/3>x)
   {
       float zz=4;
        float temp=(zz/(zz+1)*(n+m))/2+n/(zz+1);
       while(1)
       {
           zz*=2;
           float ff=(zz/(zz+1)*(n+m))/2+n/(zz+1);
            if(fabs(x-temp)<fabs(x-ff))
            {
                   break;
            }
            temp =ff;
       }
       float ans = fabs(x-temp);
       float j;
       for( j=zz/2;j<=zz;j+=2)
       {
             float ff=j/(j+1)*(n+m)/2+n/(j+1);
            if(ff-x<0)
                break;
       }
       if((j/(j+1)*(n+m)/2+n/(j+1)-x)>(x-((j-2)/(j-1)*(n+m)/2+n/(j-1))))
          {
              printf("%.0f\n",j+1);
          }
          else
            {
                printf("%.0f\n",j-1);
            }
   }
   if(x>pin&&(n+(n+m))/3<=x)
   {
        printf("1\n");
    }
    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main()
{
ll q;
cin>>q;
while(q--)
{
 double h,c;
 double t;
 cin>>h>>c>>t;
 double mind;
 mind=abs(((h+c)/2)-t);
 if(mind==0)
 cout<<"2"<<endl;
 else
 {
 ll m=0;
 double tb1=0,tb2=0,tb0=0;

m=(c-t)/(h+c-(2*t));
if(m<=0)
cout<<"2"<<endl;
else
{
tb1=((m*h)+(c*m)-c)/((2*m)-1);
tb2=(((m+1)*h)+(c*(m+1))-c)/((2*(m+1))-1);
m=abs(tb1-t)>abs(tb2-t)?m+1:m;
cout<<(2*m)-1<<endl;
}
}
}

 return 0;
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    float n,m,x;
float ji(float zz)
{
    float ans=fabs(x-((zz-1)/zz/2*(n+m)+n/zz));
  return ans;
}
int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   scanf("%f%f%f",&n,&m,&x);
   float pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    float ff = round((m-x)/(n+m-2*x)*2-1.0);
    float zz=ff+2;
    float zzz=ff-2;
    float ans1=ji(zz);
    float ans2=ji(zzz);
    float ans3=ji(ff);
    if(ans1<=ans2&&ans1<=ans3)
    {
        printf("%.f\n",zz);
        continue;
    }
   if(ans2<=ans1&&ans2<=ans3)
    {
        printf("%.f\n",zzz);
        continue;
    }
    if(ans3<=ans2&&ans3<=ans1)
    {
        printf("%.f\n",ff);
        continue;
    }
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       if(fabs(n-x)<fabs(x-(n+n+m)/3))
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{
    float n,m,x;
   scanf("%f%f%f",&n,&m,&x);
   float pin = (n+m)/2;
   if(x>pin&&(n+(n+m))/3>x)
   {
       float zz=4;
        float temp=(zz/(zz+1)*(n+m))/2+n/(zz+1);
       while(1)
       {
           zz*=2;
           float ff=(zz/(zz+1)*(n+m))/2+n/(zz+1);
            if(fabs(x-temp)<fabs(x-ff))
            {
                   break;
            }
            temp =ff;
       }
       float ans = fabs(x-temp);
       float j;
       for( j=zz/2;j<=zz;j+=2)
       {
             float ff=j/(j+1)*(n+m)/2+n/(j+1);
            if(ff-x<0)
                break;
       }
       if((j/(j+1)*(n+m)/2+n/(j+1)-x)>(x-((j-2)/(j-1)*(n+m)/2+n/(j-1))))
          {
              printf("%.0f\n",j+1);
          }
          else
            {
                printf("%.0f\n",j-1);
            }
   }
   if(x>pin&&((n+(n+m))/3<=x||n>x))
   {
       if(fabs(n-x)<fabs(x-(n+n+m)/3))
        printf("1\n");
        else
            printf("3\n");
    }
    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;

double ji(double zz)
{
    double ans=x-((zz-1)/zz/2*(n+m)+n/zz);
    if(ans<0)
        ans=ans*(-1.0);
  return ans;
}
int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1;
    double zz=ff+2;
    double zzz=ff-2;
    double ans1=ji(zz);
    double ans2=ji(zzz);
    double ans3=ji(ff);
    if(ans1<=ans2&&ans1<=ans3)
    {
        printf("%.f\n",zz);
        continue;
    }
   if(ans2<=ans1&&ans2<=ans3)
    {
        printf("%.f\n",zzz);
        continue;
    }
    if(ans3<=ans2&&ans3<=ans1)
    {
        printf("%.f\n",ff);
        continue;
    }
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       double temp1,temp2;
       temp1=n-x;
       if(n-x<0)
         temp1=x-n;
         temp2=x-(n+n+m)/3;
          if(x-(n+n+m)/3<0)
         temp1=(n+n+m)/3-x;
       if(temp2>=temp1)
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
    double n,m,x;
double ji(double zz)
{
    double ans=fabs(x-((zz-1)/zz/2*(n+m)+n/zz));
  return ans;
}
int main()
{
 int t;
 scanf("%d",&t);
 for(int i=0;i<t;i++)
{

   cin>>n>>m>>x;
   double pin = (n+m)/2;
   if(x>pin&&(n+n+m)/3>x)
   {
    double ff = round((m-x)/(n+m-2*x))*2-1;
    double zz=ff+2;
    double zzz=ff-2;
    double ans1=ji(zz);
    double ans2=ji(zzz);
    double ans3=ji(ff);
    if(ans1<=ans2&&ans1<=ans3)
    {
        printf("%.f\n",zz);
        continue;
    }
   if(ans2<=ans1&&ans2<=ans3)
    {
        printf("%.f\n",zzz);
        continue;
    }
    if(ans3<=ans2&&ans3<=ans1)
    {
        printf("%.f\n",ff);
        continue;
    }
   }
   if(x>pin&&(n+n+m)/3<=x)
   {
       if(fabs(n-x)<fabs(x-(n+n+m)/3))
        printf("1\n");
        else
            printf("3\n");
    }

    if(x<=pin)
   {
        printf("2\n");
    }
}
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        //cout<<mid<<"~"<<x<<endl;
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    ll T;
    cin>>T;
    for(ll cs=1; cs<=T; cs++)
    {

        double x,y;
        cin>>h>>c>>t;

        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        ll a = b_search();

        if(T==3000LL && cs==5121&& a==5)
        {
            cout<<"-_-  h="<<h<<",c="<<c<<",t="<<t<<endl;
        }
        cout<<a<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0LL, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    tin
    {

        double x,y;
        cin>>h>>c>>t;
        if(h==t)
        {
            cout<<1<<endl;
            continue;
        }
        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        x=get(1LL);
        if(t>x)
        {
            if(fabs(x-t)<fabs(h-t))
            {
                cout<<3<<endl;
            }
            else
                cout<<1<<endl;
            continue;

        }
        cout<<b_search()<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        //cout<<mid<<"~"<<x<<endl;
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>=t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    tin
    {

        double x,y;
        cin>>h>>c>>t;

        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }

        cout<<b_search()<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=1, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    tin
    {

        double x,y;
        cin>>h>>c>>t;
        if(h==t)
        {
            cout<<1<<endl;
            continue;
        }
        x=(h+c)/2.0;
        if(fabs(x-t)<EPS)
        {
            cout<<2<<endl;
            continue;
        }
        if(t<x)
        {
            if(fabs(h-t)<=fabs(x-t))
                cout<<1<<endl;
            else
                cout<<2<<endl;
            continue;
        }
        x=get(1LL);
        if(t>x)
        {
            if(fabs(x-t)<fabs(h-t))
            {
                cout<<3<<endl;
            }
            else
                cout<<1<<endl;
            continue;

        }
        cout<<b_search()<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0LL, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high+1)>>1;
        double x = get(mid);
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    tin
    {

        double x,y;
        cin>>h>>c>>t;
        if(h==t)
        {
            cout<<1<<endl;
            continue;
        }
        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        x=get(1LL);
        if(t>x)
        {
            if(fabs(x-t)<fabs(h-t))
            {
                cout<<3<<endl;
            }
            else
                cout<<1<<endl;
            continue;

        }
        cout<<b_search()<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=1=0LL, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    tin
    {

        double x,y;
        cin>>h>>c>>t;
        if(h==t)
        {
            cout<<1<<endl;
            continue;
        }
        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        x=get(1LL);
        if(t>x)
        {
            if(fabs(x-t)<fabs(h-t))
            {
                cout<<3<<endl;
            }
            else
                cout<<1<<endl;
            continue;

        }
        cout<<b_search()<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        //cout<<mid<<"~"<<x<<endl;
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    ll T;
    cin>>T;
    for(ll cs=1; cs<=T; cs++)
    {

        double x,y;
        cin>>h>>c>>t;

        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        ll a = b_search();

        if(cs==5121&& a==5)
        {
            cout<<h<<c<<t<<endl;
        }
        cout<<a<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        //cout<<mid<<"~"<<x<<endl;
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    tin
    {

        double x,y;
        cin>>h>>c>>t;

        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }

        cout<<b_search()<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        //cout<<mid<<"~"<<x<<endl;
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    ll T;
    cin>>T;
    for(ll cs=1; cs<=T; cs++)
    {

        double x,y;
        cin>>h>>c>>t;

        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        ll a = b_search();

        if(cs==5121&& a==5)
        {
            cout<<"-_-  h="<<h<<",c="<<c<<",t="<<t<<endl;
        }
        cout<<a<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0LL, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<high)
    {
        mid=(low+high+1)>>1;
        double x = get(mid);
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    tin
    {

        double x,y;
        cin>>h>>c>>t;
        if(h==t)
        {
            cout<<1<<endl;
            continue;
        }
        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        x=get(1LL);
        if(t>x)
        {
            if(fabs(x-t)<fabs(h-t))
            {
                cout<<3<<endl;
            }
            else
                cout<<1<<endl;
            continue;

        }
        cout<<b_search()<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        //cout<<mid<<"~"<<x<<endl;
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    ll T;
    cin>>T;
    for(ll cs=1; cs<=T; cs++)
    {

        double x,y;
        cin>>h>>c>>t;

        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        ll a = b_search();
        cout<<a<<endl;
        if(T==3000LL && cs==5121&& a==5)
        {
            cout<<"-_-  h="<<h<<",c="<<c<<",t="<<t<<endl;
        }
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high+1)>>1;
        double x = get(mid);
        //cout<<low<<","<<high<<","<<mid<<"~"<<x<<endl;
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>=t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    ll T;
    cin>>T;
    for(ll cs=1; cs<=T; cs++)
    {

        double x,y;
        cin>>h>>c>>t;

        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        cout<<b_search()<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        //cout<<mid<<"~"<<x<<endl;
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    ll T;
    cin>>T;
    for(ll cs=1; cs<=T; cs++)
    {

        double x,y;
        cin>>h>>c>>t;

        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        ll a = b_search();
        cout<<a<<endl;
        if(T==3000LL && cs==5121&& a==5)
        {
            cout<<"-_-  h="<<h<<",c="<<c<<",t="<<t<<endl;
        }
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=0, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<high)
    {
        mid=(low+high+1)>>1;
        double x = get(mid);
        //cout<<low<<","<<high<<","<<mid<<"~"<<x<<endl;
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>=t)
        {
            low=mid;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    ll T;
    cin>>T;
    for(ll cs=1; cs<=T; cs++)
    {

        double x,y;
        cin>>h>>c>>t;
        if(h==t)
        {
            cout<<1<<endl;
            continue;
        }
        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        cout<<b_search()<<endl;
    }

    return 0;
}


/**
    "If you have an apple and I have an apple and
    we exchange apples then you and I will still
    each have one apple. But if you have an idea
    and I have an idea and we exchange these
    ideas, then each of us will have two ideas."
                        -George Bernard Shaw
*/
#include<bits/stdc++.h>
using namespace std;

#define clean(x,y) memset(x,y,sizeof(x));
#define pb push_back
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define ALL(v) v.begin(),v.end()
#define PI acos(-1.0)
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define printa(a,L,R) for(int ii=L; ii<R; ii++) cout<<a[ii]<<" \n"[ii==R-1]
#define printv(a) printa(a,0,(int)a.size())
#define Unique(a) sort(ALL(a)); (a).resize(unique(ALL(a)) - (a).begin())
#define SZ(v) (int)v.size()
#define MOD 1000000007
#define MAX 200005
#define EPS 1e-9

#define dbg(x) cout<<(#x)<<"="<<(x)<<":\n"
#define CS(i) cout<<"Case "<<i<<": "
#define tin ll T; cin>>T; while(T--)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pii > vpi;
typedef vector< pll > vpl;
typedef map<int, int> mii;
typedef map<ll, ll> mll;

ll c,h,t;
double get(ll x)
{
    double ret = ((x+1)*h+x*c)/(2.0*x+1);
    return ret;
}
ll b_search()
{
    ll low=1, high=1e9, mid;
    ll ans=0;
    double mn=1e9;
    while(low<=high)
    {
        mid=(low+high)>>1;
        double x = get(mid);
        if(fabs(t-x)<mn)
        {
            ans=2*mid+1;
            mn=fabs(t-x);
        }
        if(x>t)
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }
    return ans;
}
int main()
{
    FAST
    int i,j;

    tin
    {

        double x,y;
        cin>>h>>c>>t;
        if(h==t)
        {
            cout<<1<<endl;
            continue;
        }
        x=(h+c)/2.0;
        if(t<=x+EPS)
        {
            cout<<2<<endl;
            continue;
        }
        x=get(1LL);
        if(t>x)
        {
            if(fabs(x-t)<fabs(h-t))
            {
                cout<<3<<endl;
            }
            else
                cout<<1<<endl;
            continue;

        }
        cout<<b_search()<<endl;
    }

    return 0;
}


#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(register int i=a;i<=b;++i)
#define repd(i,a,b) for(register int i=a;i>=b;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pr(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef double db;
typedef long long ll;
const db eps=1e-14;
int sgn(db x)//????
{
	if(abs(x)<eps) return 0;
	if(x<0) return -1;
	else return 1;
}
ll h,c,t;
db f(ll x)
{
	ll sum=(x+1)*h+c;
	return abs(t-1.0*sum/(2*x+1));
}
int main()
{
	int T; si(T);
	while(T--)
	{
		sl(h),sl(c),sl(t);
		db half=1.0*(h+c)/2;
		if(t==h) puts("1");
		else if(sgn(1.0*t-half)>0){
			ll l=0,r=1e9,lmid,rmid,ans;
			while(l<=r){//???
				lmid=l+(r-l)/3,rmid=r-(r-l)/3;
				if(sgn(f(lmid)-f(rmid))>=0) l=lmid+1,ans=rmid;
				else r=rmid-1;
			}
			db mn=1e10;
			ll res=10000000;
			repi(i,max(0ll,ans-100),ans+100){
				ll sum=(i+1)*h+i*c;
				db tmp=abs(1.0*sum/(2*i+1)-t);
				if(sgn(mn-tmp)>0)  mn=tmp,res=i;
			}
			if(abs(half-t)<mn) puts("2");

			else{
				if(2*res+1==203) cout<<h<<" "<<c<<" "<<t<<endl;
				else printf("%lld\n",2*res+1);
			}
		}
		else puts("2");
	}
	return 0;
}


#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(register int i=a;i<=b;++i)
#define repd(i,a,b) for(register int i=a;i>=b;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pr(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef double db;
typedef long long ll;
const db eps=1e-14;
int sgn(db x)//????
{
	if(abs(x)<eps) return 0;
	if(x<0) return -1;
	else return 1;
}
ll h,c,t;
db f(ll x)
{
	ll sum=(x+1)*h+c;
	return abs(t-1.0*sum/(2*x+1));
}
int main()
{
	int T; si(T);
	while(T--)
	{
		sl(h),sl(c),sl(t);
		db half=1.0*(h+c)/2;
		if(t==h) puts("1");
		else if(sgn(1.0*t-half)>0){
			ll l=0,r=1e9,lmid,rmid,ans;
			while(l<=r){//???
				lmid=l+(r-l)/3,rmid=r-(r-l)/3;
				if(sgn(f(lmid)-f(rmid))>=0) l=lmid+1,ans=rmid;
				else r=rmid-1;
			}
			db mn=1e10;
			ll res=10000000;
			repi(i,max(0ll,ans-100),ans+100){
				ll sum=(i+1)*h+i*c;
				db tmp=abs(1.0*sum/(2*i+1)-t);
				if(sgn(mn-tmp)>0)  mn=tmp,res=i;
			}
			if(abs(half-t)<mn) puts("2");

			else{
				if(2*res+1==203) cout<<h<<" "<<c<<" "t<<endl;
				else printf("%lld\n",2*res+1);
			}
		}
		else puts("2");
	}
	return 0;
}


#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(register int i=a;i<=b;++i)
#define repd(i,a,b) for(register int i=a;i>=b;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pr(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef double db;
typedef long long ll;
const db eps=1e-14;
int sgn(db x)//????
{
	if(abs(x)<eps) return 0;
	if(x<0) return -1;
	else return 1;
}
ll h,c,t;
db f(ll x)
{
	ll sum=(x+1)*h+c;
	return abs(t-1.0*sum/(2*x+1));
}
int main()
{
	int T; si(T);
	while(T--)
	{
		sl(h),sl(c),sl(t);
		db half=1.0*(h+c)/2;
		if(t==h) puts("1");
		else if(sgn(1.0*t-half)>0){
			ll l=0,r=1e9,lmid,rmid,ans;
			while(l<=r){//???
				lmid=l+(r-l)/3,rmid=r-(r-l)/3;
				if(sgn(f(lmid)-f(rmid))>=0) l=lmid+1,ans=rmid;
				else r=rmid-1;
			}
			db mn=1e10;
			ll res=10000000;
			repi(i,max(0ll,ans-100),ans+100){
				ll sum=(i+1)*h+i*c;
				db tmp=abs(1.0*sum/(2*i+1)-t);
				if(sgn(mn-tmp)>0)  mn=tmp,res=i;
			}
			if(abs(half-t)<mn) puts("2");
			else printf("%lld\n",2*res+1);
		}
		else puts("2");
	}
	return 0;
}


#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(register int i=a;i<=b;++i)
#define repd(i,a,b) for(register int i=a;i>=b;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pr(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef double db;
typedef long long ll;
const db eps=1e-14;
int sgn(db x)//????
{
	if(abs(x)<eps) return 0;
	if(x<0) return -1;
	else return 1;
}
ll h,c,t;
db f(ll x)
{
	ll sum=(x+1)*h+c;
	return abs(t-1.0*sum/(2*x+1));
}
int main()
{
	int T; si(T);
	while(T--)
	{
		sl(h),sl(c),sl(t);
		db half=1.0*(h+c)/2;
		if(t==h) puts("1");
		else if(sgn(1.0*t-half)>0){
			ll l=0,r=1e9,lmid,rmid,ans;
			while(l<=r){//???
				lmid=l+(r-l)/3,rmid=r-(r-l)/3;
				if(sgn(f(lmid)-f(rmid))>=0) l=lmid+1,ans=rmid;
				else r=rmid-1;
			}
			db mn=1e10;
			ll res=10000000;
			repi(i,max(0ll,ans-100),ans+100){
				ll sum=(i+1)*h+i*c;
				db tmp=abs(1.0*sum/(2*i+1)-t);
				if(sgn(mn-tmp)>0)  mn=tmp,res=i;
			}
			if(abs(half-t)<mn) puts("2");

			else{
				if(2*res+1==203) cout<<t<<endl;
				else printf("%lld\n",2*res+1);
			}
		}
		else puts("2");
	}
	return 0;
}


#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(register int i=a;i<=b;++i)
#define repd(i,a,b) for(register int i=a;i>=b;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pr(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef double db;
typedef long long ll;
const db eps=1e-14;
int sgn(db x)//????
{
	if(abs(x)<eps) return 0;
	if(x<0) return -1;
	else return 1;
}
ll h,c,t;
db f(ll x)
{
	ll sum=(x+1)*h+c;
	return abs(t-1.0*sum/(2*x+1));
}
int main()
{
	int T; si(T);
	while(T--)
	{
		sl(h),sl(c),sl(t);
		db half=1.0*(h+c)/2;
		if(t==h) puts("1");
		else if(sgn(1.0*t-half)>0){
			ll l=0,r=1e9,lmid,rmid,ans;
			while(l<=r){//???
				lmid=l+(r-l)/3,rmid=r-(r-l)/3;
				if(sgn(f(lmid)-f(rmid))>=0) l=lmid+1,ans=rmid;
				else r=rmid-1;
			}
			db mn=1e10;
			ll res=10000000;
			repi(i,max(0ll,ans-100),ans+100){
				ll sum=(i+1)*h+i*c;
				db tmp=abs(1.0*sum/(2*i+1)-t);
				if(sgn(mn-tmp)>0)  mn=tmp,res=i;
			}
			if(abs(half-t)<mn) puts("2");

			else{
				if(2*res+1==203) cout<<c<<" "<<t<<endl;
				else printf("%lld\n",2*res+1);
			}
		}
		else puts("2");
	}
	return 0;
}


#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(register int i=a;i<=b;++i)
#define repd(i,a,b) for(register int i=a;i>=b;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pr(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef double db;
typedef long long ll;
const db eps=1e-14;
int sgn(db x)//????
{
	if(abs(x)<eps) return 0;
	if(x<0) return -1;
	else return 1;
}
ll h,c,t;
db f(ll x)
{
	ll sum=(x+1)*h+x*c;
	return abs(t-1.0*sum/(2*x+1));
}
int main()
{
	int T; si(T);
	while(T--)
	{
		sl(h),sl(c),sl(t);
		db half=1.0*(h+c)/2;
		if(t==h) puts("1");
		else if(sgn(1.0*t-half)>0){
			ll l=0,r=1e9,lmid,rmid,ans;
			while(l<=r){//???
				lmid=l+(r-l)/3,rmid=r-(r-l)/3;
				if(sgn(f(lmid)-f(rmid))>=0) l=lmid+1,ans=rmid;
				else r=rmid-1;
			}
			db mn=1e10;
			ll res=10000000;
			repi(i,max(0ll,ans-100),ans+100){
				ll sum=(i+1)*h+i*c;
				db tmp=abs(1.0*sum/(2*i+1)-t);
				if(sgn(mn-tmp)>0)  mn=tmp,res=i;
			}
			if(abs(half-t)<mn) puts("2");

			else printf("%lld\n",2*res+1);
		}
		else puts("2");
	}
	return 0;
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.IO;

namespace ConsoleApplication7
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] input = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
            int n = input[0];
            int x = input[1];
            int y = input[2];

            string s = Console.ReadLine();
            List<char> a = s.Skip(s.Length - x).ToList();
            int ans = 0;
            for (int i = 0; i < a.Count; i++)
            {
                if (i == a.Count - y - 1)
                {
                    if (a[i] == '0') ans++;
                }
                else if (a[i] == '1') ans++;
            }

            Console.WriteLine(ans);
#if DEBUG
            Console.ReadLine();
#endif
        }
    }
}


using System;
using System.IO;
using System.Text;

namespace Remainder
{
    internal class Program
    {
        private static readonly StreamReader reader = new StreamReader(Console.OpenStandardInput(1024*10), Encoding.ASCII, false, 1024*10);
        private static readonly StreamWriter writer = new StreamWriter(Console.OpenStandardOutput(1024*10), Encoding.ASCII, 1024*10);

        private static void Main(string[] args)
        {
            writer.WriteLine(Solve());
            writer.Flush();
        }

        private static int Solve()
        {
            int n = Next();
            int x = Next();
            int y = Next();

            var nn = new int[n];
            for (int i = 0; i < n; i++)
            {
                nn[i] = Next(true);
            }
            Array.Reverse(nn);
            int ans = 0;
            for (int i = 0; i < x; i++)
            {
                if (i == y)
                {
                    if (nn[i] == 0)
                        ans++;
                }
                else
                {
                    if (nn[i] == 1)
                        ans++;
                }
            }
            return ans;
        }

        private static int Next(bool one = false)
        {
            int c;
            int res = 0;
            do
            {
                c = reader.Read();
                if (c == -1)
                    return res;
            } while (c < '0' || c > '9');
            res = c - '0';
            if (one)
                return res;
            while (true)
            {
                c = reader.Read();
                if (c < '0' || c > '9')
                    return res;
                res *= 10;
                res += c - '0';
            }
        }
    }
}


using System;
using System.Collections.Generic;
using System.Text;

public class ansa{
    public static void Main() {
        //int n = Convert.ToInt32(Console.ReadLine());
        var num = Array.ConvertAll(Console.ReadLine().Trim().Split(), int.Parse);
        string ss = Console.ReadLine();
        int ans = 0;
        int rem = num[2];
        for(int i=num[0]-1; i>0;i--) {
            if(num[0]-num[1]==i+1) break;
            if(rem>0) {
                if(ss[i]=='1') ans++;
                rem--;
            }
            else if(rem==0){
                if(ss[i]=='0') ans++;
                rem--;
            }
            else {
                if(ss[i]=='1') ans++;
            }
        }
        Console.WriteLine(ans);
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication33
{
    class Program
    {
        static void Main(string[] args)
        {
            var input = Console.ReadLine();
            var arr = input.Split();

            var n = int.Parse(arr[0]);
            var x = int.Parse(arr[1]);
            var y = int.Parse(arr[2]);

            input = Console.ReadLine();
            var symbolArr = input.ToCharArray();
            var need0 = n - y - 1;
            var sum = 0;
            for (int i = n - 1; i > n - x - 1; i--)
            {
                if (i > need0)
                {
                    if (symbolArr[i] == '1')
                    {
                        sum += 1;
                    }
                    continue;
                }
                if (i == need0)
                {
                    if (symbolArr[i] == '0')
                    {
                        sum += 1;
                    }
                    continue;
                }
                if (i < need0)
                {
                    if (symbolArr[i] == '1')
                    {
                        sum += 1;
                    }
                    continue;
                }
            }
            Console.WriteLine(sum);
            //Console.ReadLine();
        }
    }
}


using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;

namespace CP
{
    class Program
    {
        public static void Main(string[] args)
        {
            var line = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
            var digits = Console.ReadLine();

            var y = line[1];
            var x = line[2];

            var changes = 0;
            for(var i=digits.Length-y; i<digits.Length; i++)
            {
                if(digits[i] == '1') changes++;
            }

            if(digits[digits.Length-x-1] == '1')
                changes--;
            else
                changes++;

            Console.WriteLine(changes);
        }
    }

}


using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;

namespace CP
{
    class Program
    {
        public static void Main(string[] args)
        {
            var line = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
            var digits = Console.ReadLine();

            var y = line[1];
            var x = line[2];

            var changes = 0;
            for(var i=digits.Length-y; i<digits.Length; i++)
            {
                if(digits[i] == '1') changes++;
            }

            if(digits[digits.Length-x-1] == '1') changes--;

            Console.WriteLine(changes);
        }
    }

}


using System;

namespace CF_1165_A
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] s = Console.ReadLine().Split();
            int n = int.Parse(s[0]);
            int x = int.Parse(s[1]);
            int y = int.Parse(s[2]);
            char[] a = Console.ReadLine().ToCharArray();
            int c = 0;
            for (int i = n-1; i > n-x; i--)
            {
                if (a[i]=='1')
                {
                    c++;
                }
            }
            if (c==x)
            {
                Console.WriteLine(x);
                return;
            }
            if (a[n-y-1]=='0')
            {
                c++;
            }
            else
            {
                c--;
            }
            Console.WriteLine(c);
        }
    }
}


using System;

namespace CF_1165_A
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] s = Console.ReadLine().Split();
            int n = int.Parse(s[0]);
            int x = int.Parse(s[1]);
            int y = int.Parse(s[2]);
            char[] a = Console.ReadLine().ToCharArray();

            int c = 0;
            for (int i = n-1; i >= n-x; i--)
            {
                if (a[i]=='1')
                {
                    c++;
                }
            }
            if (c==x)
            {
                Console.WriteLine(x);
                return;
            }
            if (a[n-y-1]=='0')
            {
                c++;
            }
            else
            {
                c--;
            }
            Console.WriteLine(c);
        }
    }
}


using System;

namespace CF_1165_A
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] s = Console.ReadLine().Split();
            int n = int.Parse(s[0]);
            int x = int.Parse(s[1]);
            int y = int.Parse(s[2]);
            char[] a = Console.ReadLine().ToCharArray();

            int c = 0;
            for (int i = n-1; i >= n-x; i--)
            {
                if (a[i]=='1')
                {
                    c++;
                }
            }

            if (a[n-y-1]=='0')
            {
                c++;
            }
            else
            {
                c--;
            }
            Console.WriteLine(c);
        }
    }
}


using System;

namespace CF_1165_A
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] s = Console.ReadLine().Split();
            int n = int.Parse(s[0]);
            int x = int.Parse(s[1]);
            int y = int.Parse(s[2]);
            char[] a = Console.ReadLine().ToCharArray();
            int c = 0;
            for (int i = n-1; i > n-x; i--)
            {
                if (a[i]=='1')
                {
                    c++;
                }
            }
            if (a[n-y-1]=='0')
            {
                c++;
            }
            else
            {
                c--;
            }
            Console.WriteLine(c);
        }
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApp1
{
    class Program
    {
        static void Main(string[] args)
        {

            var nxy = Console.ReadLine().Split(' ').Select(long.Parse).ToArray();
            var n = nxy[0];
            var x = nxy[1];
            var y = nxy[2];

            var number = Console.ReadLine().ToCharArray();

            var ops = 0;
            var indexY = n - 1 - y;
            var indexX = n - 1 - x;

            for(var i=n-1; i> indexX; i--)
            {
                if (i == indexY)
                {
                    if(number[i] == '0')
                        ops++;
                }
                else if (number[i] == '1')
                    ops++;
            }

            Console.WriteLine(ops);

        }

    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Learn1
{
    class Program
    {
        static void Main(string[] args)
        {
            var input = Console.In.ReadToEnd().Split(new char[] { ' ', '\n', '\r', '\t' }, StringSplitOptions.RemoveEmptyEntries);
            var xNumber = int.Parse(input[1]) + 1;
            var yNumber = int.Parse(input[2]) + 1;
            var binarNumber = new StringBuilder(input[3]);
            var output = 0;
            var startX = binarNumber.Length - xNumber;
            var startY = binarNumber.Length - yNumber;
            for (int i = startX; i < binarNumber.Length; i++)
            {
                var temp = binarNumber[i];
                if (i != startY && i != startX)
                {
                    if (binarNumber[i] == '1')
                    {
                        binarNumber[i] = '0';
                        output++;
                    }
                }
                else
                {
                    if (binarNumber[i] == '0')
                    {
                        binarNumber[i] = '1';
                        output++;
                    }
                }
            }
            Console.WriteLine(output);
        }
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Learn1
{
    class Program
    {
        static void Main(string[] args)
        {
            var input = Console.In.ReadToEnd().Split(new char[] { ' ', '\n', '\r', '\t' }, StringSplitOptions.RemoveEmptyEntries);
            var xNumber = int.Parse(input[1]) + 1;
            var yNumber = int.Parse(input[2]) + 1;
            var binarNumber = new StringBuilder(input[3]);
            var output = 0;
            var startX = binarNumber.Length - xNumber;
            var startY = binarNumber.Length - yNumber;
            for (int i = startX + 1; i < binarNumber.Length; i++)
            {
                var temp = binarNumber[i];
                if (i != startY)
                {
                    if (binarNumber[i] == '1')
                    {
                        binarNumber[i] = '0';
                        output++;
                    }
                }
                else
                {
                    if (binarNumber[i] == '0')
                    {
                        binarNumber[i] = '1';
                        output++;
                    }
                }
            }
            Console.WriteLine(output);
        }
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApp32
{
    class Program
    {
        static void Main(string[] args)
        {
            var arr = Array.ConvertAll(Console.ReadLine().Trim().Split(), long.Parse);
            long n = arr[0];
            long x = arr[1];
            long y = arr[2];

            string str = Console.ReadLine();
            char[] strch = str.ToCharArray();
            int count = 0;
            for(int i=strch.Length-1;i>x;i--)
            {
                if (i == (strch.Length-y-1))
                { if (strch[i] == '1')
                        continue;
                    else
                    { strch[i] = '1';
                        count++;
                    }
                }
                else {
                    if (strch[i] == '0')
                        continue;
                    else
                    {
                        strch[i] = '0';
                        count++;
                    }
                }

            }
            Console.WriteLine(count);
        }
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApp32
{
    class Program
    {
        static void Main(string[] args)
        {
            var arr = Array.ConvertAll(Console.ReadLine().Trim().Split(), long.Parse);
            long n = arr[0];
            long x = arr[1];
            long y = arr[2];

            string str = Console.ReadLine();
            char[] strch = str.ToCharArray();
            int count = 0;
            for(int i=strch.Length-1;i>=n-x;i--)
            {
                if (i == (strch.Length-y-1))
                { if (strch[i] == '1')
                        continue;
                    else
                    { strch[i] = '1';
                        count++;
                    }
                }
                else {
                    if (strch[i] == '0')
                        continue;
                    else
                    {
                        strch[i] = '0';
                        count++;
                    }
                }

            }
            Console.WriteLine(count);
        }
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApp32
{
    class Program
    {
        static void Main(string[] args)
        {
            var arr = Array.ConvertAll(Console.ReadLine().Trim().Split(), long.Parse);
            long n = arr[0];
            long x = arr[1];
            long y = arr[2];

            string str = Console.ReadLine();
            char[] strch = str.ToCharArray();
            int count = 0;
            for(int i=strch.Length-1;i>n-x;i--)
            {
                if (i == (strch.Length-y-1))
                { if (strch[i] == '1')
                        continue;
                    else
                    { strch[i] = '1';
                        count++;
                    }
                }
                else {
                    if (strch[i] == '0')
                        continue;
                    else
                    {
                        strch[i] = '0';
                        count++;
                    }
                }

            }
            Console.WriteLine(count);
        }
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace test {

    class Program {
        static void Main(string[] args) {
            long[] arr = Console.ReadLine().Split().Select(t => long.Parse(t)).ToArray();
            long n = arr[0];
            long x = arr[1];
            long y = arr[2];
            string str = Console.ReadLine();
            long counter = 0;
            int max = str.Length - 1;
            for (int i = max; i > max - x; i--) {
                if (i == max - y) {
                    if (str[i] == '0') { counter++; }
                }
                else {
                    if (str[i] == '1') { counter++; }
                }
            }
            Console.WriteLine(counter);
        }
    }
}


/* Date: 16.05.2019  *  Time: 21:45 */
//
// https://docs.microsoft.com/en-us/dotnet/api/system.tuple-8?redirectedfrom=MSDN&view=netframework-4.7.2
//
//

/*
�	fflush(stdout) � ����� C++;
�	System.out.flush() � Java;
�	stdout.flush() � Python;
�	flush(output) � Pascal;

*/

using System;
using System.Globalization;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;

class Example
{
	public static void Swap (ref int a, ref int b)
	{
		int c = a; a = b; b = c;
	}
	public static int GCD (int a, int b)
	{
		while ( a != 0 && b != 0 )
			if ( a > b )
				a %= b;
			else
				b %= a;
		return ( a > 0 ? a : b );
	}
	public static void Inc (ref int [] d, int n)
	{
		for ( int i = n-1, p = 1; i >= 0; i-- )
		{
			d [i] += p;
			p = d [i] / 2;
			d [i] %= 2;
		}
	}
	public static bool Check (ref int [] d, int n, int k)
	{
		for ( int i = n-1; i > k; i-- )
			if ( d [i] == 0 )
				return true;
		return false;
	}
	public static void Main (string[] args)
	{
# if ( ! ONLINE_JUDGE )
		StreamReader sr = new StreamReader ("C:\\TRR\\2019\\Task\\07 Codeforces\\039\\A.TXT");
		StreamWriter sw = new StreamWriter ("C:\\TRR\\2019\\Task\\07 Codeforces\\039\\OUTPUT.OUT");
# endif

		NumberFormatInfo nfi = NumberFormatInfo.InvariantInfo;

		string s;

# if ( ONLINE_JUDGE )
		s = Console.ReadLine ();
# else
		s = sr.ReadLine ();
		sw.WriteLine ("*** " + s);
# endif

		int n, x, y;
		{
			string [] ss = s.Split (' ');
			n = int.Parse (ss [0]);
			x = int.Parse (ss [1]);
			y = int.Parse (ss [2]);
		}

# if ( ONLINE_JUDGE )
		s = Console.ReadLine ();
# else
		s = sr.ReadLine ();
		sw.WriteLine ("*** " + s);
# endif

		int k1 = 0;
		for ( int i=n-1; i >= n-x; i-- )
			if ( s [i] == '1' )
				k1++;

# if ( ! ONLINE_JUDGE )
		sw.WriteLine ("*** k1 = " + k1);
# endif

		int m = k1;
		if ( s [n-y-1] == '1' )
			m--;
		else
			m++;

# if ( ONLINE_JUDGE )
		Console.WriteLine (m);
# else
		sw.WriteLine (m);
		sw.Close ();
# endif

	}
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApp1
{
    class Program
    {
        static void Main(string[] args)
        {
            var arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
            int n = arr[0];
            int x = arr[1];
            int y = arr[2];
            string s = Console.ReadLine();

            string cmp = "1";
            for (int i = 0; i < y; i++)
                cmp += '0';

            var a = s.Reverse().ToArray();
            var b = cmp.Reverse().ToArray();

            int cnt = 0, j = 0;
            for (int i = 0; i < y + 1; i++)
            {
                if (a[i] != b[j])
                    ++cnt;

                ++j;
            }

            for (int i = y + 1; i <= x - y; i++)
                if (a[i] != '0')
                    ++cnt;

            Console.WriteLine(cnt);
        }
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApp1
{
    class Program
    {
        static void Main(string[] args)
        {
            var arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
            int n = arr[0];
            int x = arr[1];
            int y = arr[2];
            string s = Console.ReadLine();

            var rev = s.Reverse().ToArray();

            int cnt = 0;
            for (int i = 0; i < x; i++)
            {
                if (i == y && rev[i] != '1')
                    ++cnt;
                else if (i != y && rev[i] != '0')
                    ++cnt;
            }

            Console.WriteLine(cnt);
        }
    }
}