#include <stdio.h>
#include <stdio.h>
#include <ctype.h>

int main() {
    int n, m, i, num, tmp, flag = 1, rozdil, max = 0;
    scanf("%d %d", &n, &m);
    int array[n+2];

   for (i=1; i<n+1; i++) {
       scanf("%d", &num);
       array[i] = num;
   }

   array[0] = -array[1];
   array[n+2] = m + m-array[n+1];

   while (flag != 0) {
       flag = 0;
   for (i=0; i<n+1; i++) {
       if (array[i] > array[i+1]) {
           tmp = array[i];
           array[i] = array[i+1];
           array[i+1] = tmp;
           flag = 1;
       }
   }
   }

   for (i=0; i<n; i++) {
       rozdil = array[i+1] - array[i];
      // printf("rozdil %d\n", rozdil);
       if ( rozdil > max) max = rozdil;
       // printf("max %d\n", max);
   }

   printf("%lf0000\n", max/2.);

  return 0;

}


#include <stdio.h>
#include <stdio.h>
#include <ctype.h>

int main() {
    int n, m, i, num, tmp, flag = 1, rozdil, max = 0;
    scanf("%d %d", &n, &m);
    int array[n+2];

   for (i=1; i<n+1; i++) {
       scanf("%d", &num);
       array[i] = num;
   }

   while (flag != 0) {
       flag = 0;
   for (i=1; i<n; i++) {
       if (array[i] > array[i+1]) {
           tmp = array[i];
           array[i] = array[i+1];
           array[i+1] = tmp;
           flag = 1;
       }
   }
   }

   array[0] = -array[1];
   array[n+1] = m + m-array[n];

   for (i=0; i<n+1; i++) {
       rozdil = array[i+1] - array[i];
      // printf("rozdil %d\n", rozdil);
       if ( rozdil > max) max = rozdil;
       // printf("max %d\n", max);
   }

   printf("%lf0000\n", max/2.);

  return 0;

}


#include <stdio.h>
#include <stdio.h>
#include <ctype.h>

int main() {
    int n, m, i, num, tmp, flag = 1, rozdil, max = 0;
    scanf("%d %d", &n, &m);
    int array[n+2];

   for (i=1; i<n+1; i++) {
       scanf("%d", &num);
       array[i] = num;
   }

   while (flag != 0) {
       flag = 0;
   for (i=1; i<n; i++) {
       if (array[i] > array[i+1]) {
           tmp = array[i];
           array[i] = array[i+1];
           array[i+1] = tmp;
           flag = 1;
       }
   }
   }

   array[0] = -array[1];
   array[n+2] = m + m-array[n+1];

   for (i=0; i<n+1; i++) {
       rozdil = array[i+1] - array[i];
      // printf("rozdil %d\n", rozdil);
       if ( rozdil > max) max = rozdil;
       // printf("max %d\n", max);
   }

   printf("%lf0000\n", max/2.);

  return 0;

}


#include<stdio.h>
#include<string.h>

int radd(int * s,int num, int len);
int bise(int * s,int num, int len);
int main(){
	int len,num,gar,temp;
	scanf("%d",&num);
		while(!(getchar()) == '\n');
	scanf("%d",&len);
		while(!(getchar()) == '\n');

	int * s = (int *)malloc(sizeof(int)*num);
	temp = 0;
		while(temp<num){

		scanf("%d",&s[temp]);
			if(s[temp] <= len){
				temp++;
					}
		while(!(getchar()) == '\n');
				}

	bise(s,num,len);

	radd(s,num,len);

return 0;
}

int bise(int * s, int num,int len){

int i,j,temp;
int gar;

	for(i=0;i<num;i++){
		for(j=i;j<num;j++){

			if(s[i]>s[j]){

			temp = s[i];
			s[i] = s[j];
			s[j] = temp;

				}

			 }
				  }

return 0;
}

int radd(int * s,int num, int len){
	int i,l;
	i = 2*s[0];
	float fin;

for(l=0;l<num;l++){

	if( l != (num-1) ){

	if(i<(s[l+1]-s[l])){
		i = s[l+1] - s[l];
			}
				}
	else {
	if( i <len - s[num-1] ){

		i =2*( len - s[num-1]);
				  }
		}
		}
	fin = (float)i/2;
printf("%.10f\n",fin);
return 0;
}


#include<stdio.h>
#include<string.h>

int radd(int * s,int num, int len);
int bise(int * s,int num, int len);
int main(){
	int len,num,gar,temp;
	scanf("%d",&num);
		while(!(getchar()) == '\n');
	scanf("%d",&len);
		while(!(getchar()) == '\n');

	int * s = (int *)malloc(sizeof(int)*num);
	temp = 0;
		while(temp<num){

		scanf("%d",&s[temp]);
			if(s[temp] <= len){
				temp++;
					}
		while(!(getchar()) == '\n');
				}

		for(gar = 0;gar<num;gar++){
			printf("%d  ",s[gar]);
					  }
	printf("\n");

	bise(s,num,len);

		for(gar = 0;gar<num;gar++){
			printf("%d  ",s[gar]);
					  }

	printf("\n");

	radd(s,num,len);

return 0;
}

int bise(int * s, int num,int len){

int i,j,temp;
int gar;

	/*	for(gar = 0;gar<num;gar++){
			printf("%d  ",s[gar]);
					  }

	printf("\n");
*/

	for(i=0;i<num;i++){
		for(j=i;j<num;j++){

			if(s[i]>s[j]){

			temp = s[i];
			s[i] = s[j];
			s[j] = temp;

				}

			 }
				  }

return 0;
}

int radd(int * s,int num, int len){
	int i,l;
	i = s[0];
	float fin;

for(l=0;l<num;l++){

	if( l != (num-1) ){

	if(i<(s[l+1]-s[l])){
		i = s[l+1] - s[l];
			}
				}
	else {
	if( i < (len - s[num-1]) ){

		i = len - s[num-1];
				  }
		}
	printf("%d ",i);
		}
	fin = (float)i/2;
printf("%.10f\n",fin);
return 0;
}


#include<stdio.h>
#include<string.h>

int radd(int * s,int num, int len);
int bise(int * s,int num, int len);
int main(){
	int len,num,gar,temp;
	scanf("%d",&num);
		while(!(getchar()) == '\n');
	scanf("%d",&len);
		while(!(getchar()) == '\n');

	int * s = (int *)malloc(sizeof(int)*num);
	temp = 0;
		while(temp<num){

		scanf("%d",&s[temp]);
			if(s[temp] <= len){
				temp++;
					}
		while(!(getchar()) == '\n');
				}

	bise(s,num,len);

	radd(s,num,len);

return 0;
}

int bise(int * s, int num,int len){

int i,j,temp;
int gar;

	for(i=0;i<num;i++){
		for(j=i;j<num;j++){

			if(s[i]>s[j]){

			temp = s[i];
			s[i] = s[j];
			s[j] = temp;

				}

			 }
				  }

return 0;
}

int radd(int * s,int num, int len){
	int i,l;
	i = 2*s[0];
	float fin;

for(l=0;l<num;l++){

	if( l != (num-1) ){

	if(i<(s[l+1]-s[l])){
		i = s[l+1] - s[l];
			}
				}
	else {
	if( i <2*(len - s[num-1]) ){

		i =2*( len - s[num-1]);
				  }
		}
		}
	fin = (float)i/2;
printf("%.10f\n",fin);
return 0;
}


#include<stdio.h>
#include<string.h>

int radd(int * s,int num, int len);
int bise(int * s,int num, int len);
int main(){
	int len,num,gar,temp;
	scanf("%d",&num);
		while(!(getchar()) == '\n');
	scanf("%d",&len);
		while(!(getchar()) == '\n');

	int * s = (int *)malloc(sizeof(int)*num);
	temp = 0;
		while(temp<num){

		scanf("%d",&s[temp]);
			if(s[temp] <= len){
				temp++;
					}
		while(!(getchar()) == '\n');
				}

	bise(s,num,len);

	radd(s,num,len);

return 0;
}

int bise(int * s, int num,int len){

int i,j,temp;
int gar;

	for(i=0;i<num;i++){
		for(j=i;j<num;j++){

			if(s[i]>s[j]){

			temp = s[i];
			s[i] = s[j];
			s[j] = temp;

				}

			 }
				  }

return 0;
}

int radd(int * s,int num, int len){
	int i,l;
	i = s[0];
	float fin;

for(l=0;l<num;l++){

	if( l != (num-1) ){

	if(i<(s[l+1]-s[l])){
		i = s[l+1] - s[l];
			}
				}
	else {
	if( i < (len - s[num-1]) ){

		i = len - s[num-1];
				  }
		}
		}
	fin = (float)i/2;
printf("%.10f\n",fin);
return 0;
}


#include<stdio.h>
#include<string.h>

int radd(int * s,int num, int len);
int bise(int * s,int num, int len);
int main(){
	int len,num,gar,temp;
	scanf("%d",&num);
		while(!(getchar()) == '\n');
	scanf("%d",&len);
		while(!(getchar()) == '\n');

	int * s = (int *)malloc(sizeof(int)*num);
	temp = 0;
		while(temp<num){

		scanf("%d",&s[temp]);
			if(s[temp] <= len){
				temp++;
					}
		while(!(getchar()) == '\n');
				}

	bise(s,num,len);

	radd(s,num,len);

return 0;
}

int bise(int * s, int num,int len){

int i,j,temp;
int gar;

	for(i=0;i<num;i++){
		for(j=i;j<num;j++){

			if(s[i]>s[j]){

			temp = s[i];
			s[i] = s[j];
			s[j] = temp;

				}

			 }
				  }

return 0;
}

int radd(int * s,int num, int len){
	int i,l;
	i = 2*s[0];
	float fin;

for(l=0;l<num;l++){

	if( l != (num-1) ){

	if(i<(s[l+1]-s[l])){
		i = s[l+1] - s[l];
			}
				}
	else {
	if( i <2*(len - s[num-1]) ){

		i = len - s[num-1];
				  }
		}
		}
	fin = (float)i/2;
printf("%.10f\n",fin);
return 0;
}


#include<stdio.h>
#include<string.h>

int radd(int * s, int num, int len);
int bise(int * s, int num, int len);
int main() {
	int len, num, gar, temp=0;
	int s[1000];
	scanf("%d %d", &num, &len);

	while (temp<num) {

		scanf("%d", &s[temp]);
		if (s[temp] <= len)temp++;
					}
	bise(s, num, len);
	radd(s, num, len);

	return 0;
}

int bise(int * s, int num, int len) {

	int i, j, temp;
	int gar;

	for (i = 0; i<num; i++) {
		for (j = i; j<num; j++) {

			if (s[i]>s[j]) {

				temp = s[i];
				s[i] = s[j];
				s[j] = temp;

			}

		}
	}

	return 0;
}

int radd(int * s, int num, int len) {
	int i, l;
	i = 2 * s[0];
	float fin;

	for (l = 0; l<num; l++) {

		if (l != (num - 1)) {

			if (i<(s[l + 1] - s[l])) {
				i = s[l + 1] - s[l];
			}
		}
		else {
			if (i <2 * (len - s[num - 1])) {

				i = 2 * (len - s[num - 1]);
			}
		}
	}
	fin = (float)i / 2;
	printf("%.10f\n", fin);
	return 0;
}


#include<stdio.h>
int main(){
	long long int n,l,i,j,tmp,dif=0,ans;
	scanf("%I64d %I64d",&n,&l);
	long long int a[n];
	for(i=0;i<n;i++){
		scanf("%I64d",&a[i]);
	}
	for(i=0;i<n-1;i++){
		for(j=i+1;j<n;j++){
			if(a[i]>a[j]){
				tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
		}
	}
	for(i=0;i<n-1;i++){
		dif = a[i+1]-a[i] > dif ? a[i+1]-a[i] : dif;
	}
	ans = dif;
	if(a[0]>ans){
		ans = a[0];
	}
	if(l-a[n-1] > ans){
		ans = l-a[n-1];
	}
	printf("%lf",ans);
	return 0;
}


#include<stdio.h>
int main(){
	long long int n,l,i,j,tmp,dif=0,ans;
	scanf("I64 %I64d",&n,&l);
	long long int a[n];
	for(i=0;i<n;i++){
		scanf("%I64d",&a[i]);
	}
	for(i=0;i<n-1;i++){
		for(j=i+1;j<n;j++){
			if(a[i]>a[j]){
				tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
		}
	}
	for(i=0;i<n-1;i++){
		dif = a[i+1]-a[i] > dif ? a[i+1]-a[i] : dif;
	}
	ans = dif;
	if(a[0]>ans){
		ans = a[0];
	}
	if(l-a[n-1] > ans){
		ans = l-a[n-1];
	}
	printf("%lf",ans);
	return 0;
}


#include<stdio.h>
int main(){
	long long int n,l,i,j,tmp,dif=0;
	double ans;
	scanf("%I64d %I64d",&n,&l);
	long long int a[n];
	for(i=0;i<n;i++){
		scanf("%I64d",&a[i]);
	}
	for(i=0;i<n;i++){
		for(j=i+1;j<n;j++){
			if(a[i]>a[j]){
				tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
		}
	}
	for(i=0;i<n-1;i++){
		dif = a[i+1]-a[i] > dif ? a[i+1]-a[i] : dif;
		printf("%I64d ",a[i]);
	}
	printf("%I64d",a[n-1]);
	ans = (double)dif/2;
	if(a[0]>ans){
		ans = a[0];
	}
	if(l-a[n-1] > ans){
		ans = l-a[n-1];
	}
	printf("%lf",ans);
	return 0;
}


#include<stdio.h>
int main(){
	long long int n,l,i,j,tmp,dif=0;
	double ans;
	scanf("%I64d %I64d",&n,&l);
	long long int a[n];
	for(i=0;i<n;i++){
		scanf("%I64d",&a[i]);
	}
	for(i=0;i<n;i++){
		for(j=i+1;j<n;j++){
			if(a[i]>a[j]){
				tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
		}
	}
	for(i=0;i<n-1;i++){
		dif = a[i+1]-a[i] > dif ? a[i+1]-a[i] : dif;
	}
	ans = (double)dif/2;
	if(a[0]>ans){
		ans = a[0];
	}
	if(l-a[n-1] > ans){
		ans = l-a[n-1];
	}
	printf("%lf",ans);
	return 0;
}


#include<stdio.h>
int main(){
	long long int n,l,i,j,tmp,dif=0,ans;
	scanf("%I64 %I64d",&n,&l);
	long long int a[n];
	for(i=0;i<n;i++){
		scanf("%I64d",&a[i]);
	}
	for(i=0;i<n-1;i++){
		for(j=i+1;j<n;j++){
			if(a[i]>a[j]){
				tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
		}
	}
	for(i=0;i<n-1;i++){
		dif = a[i+1]-a[i] > dif ? a[i+1]-a[i] : dif;
	}
	ans = dif;
	if(a[0]>ans){
		ans = a[0];
	}
	if(l-a[n-1] > ans){
		ans = l-a[n-1];
	}
	printf("%lf",ans);
	return 0;
}


#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <float.h>

int main(){

	long long int m,temp=0;
	float output =0.0,temp1=0.0;
	int n,i,j;
	scanf("%d", &n);
	scanf("%I64d", &m);
	long long int arr[n+2];
	arr[0] = 0;
	arr[n+1] = m;
	for(i=1;i<n+1;i++){
		scanf("%I64d", &arr[i]);
	}
	for(i=0;i<n;i++){
		for(j=0;j<n-i;j++){
		if(arr[j] > arr[j+1]){
				temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
	for(i=0;i<n+2;i++){
		//printf("%I64d\n", arr[i]);
		if(i==0)
		temp1 = (float)((arr[i+1] - arr[i]));
		if(i==n+1)
		temp1 = (float)((arr[i] - arr[i-1]));
		temp1 = (float)(((arr[i+1] - arr[i])/2.0));
		//printf("%f\n", temp1);
		if (temp1 >= output)
		output = temp1;
	}

	printf("%f", output);

	return 0;
}


#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <float.h>

int main(){

	long long int m,temp=0;
	float output =0.0,temp1=0.0;
	int n,i,j;
	scanf("%d", &n);
	scanf("%I64d", &m);
	long long int arr[n+2];
	arr[0] = 0;
	arr[n+1] = m;
	for(i=1;i<n+1;i++){
		scanf("%I64d", &arr[i]);
	}
	for(i=0;i<n;i++){
		for(j=0;j<n-i;j++){
		if(arr[j] > arr[j+1]){
				temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
	for(i=0;i<n+2;i++){
		printf("%I64d\n", arr[i]);
		if(i==0)
		temp1 = (float)((arr[i+1] - arr[i]));
		else if(i==n+1)
		temp1 = (float)((arr[i] - arr[i-1]));
		else{
		temp1 = (float)(((arr[i+1] - arr[i])/2.0));
		}
		printf("%f\n", temp1);
		if (temp1 >= output)
		output = temp1;
	}

	printf("%f", output);

	return 0;
}


#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <float.h>

int main(){

	long long int m,temp=0;
	double output =0.000,temp1=0.000;
	int n,i,j;
	scanf("%d", &n);
	scanf("%I64d", &m);
	long long int arr[n+2];
	arr[0] = 0;
	arr[n+1] = m;
	for(i=1;i<n+1;i++){
		scanf("%I64d", &arr[i]);
	}
	for(i=0;i<n;i++){
		for(j=0;j<n-i;j++){
		if(arr[j] > arr[j+1]){
				temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
	for(i=0;i<n+2;i++){
		//printf("%I64d\n", arr[i]);
		if(i==0)
		temp1 = (double)((arr[i+1] - arr[i]));
		else if(i==n+1)
		temp1 = (double)((arr[i] - arr[i-1]));
		else{
		temp1 = (double)(((arr[i+1] - arr[i])/2.00));
		}
		//printf("%lf\n", temp1);
		if (temp1 >= output)
		output = temp1;
	}

	printf("%.9lf", output);

	return 0;
}


#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <float.h>

int main(){

	long long int m,temp=0;
	float output =0.0,temp1=0.0;
	int n,i,j;
	scanf("%d", &n);
	scanf("%I64d", &m);
	long long int arr[n+2];
	arr[0] = 0;
	arr[n+1] = m;
	for(i=1;i<n+1;i++){
		scanf("%I64d", &arr[i]);
	}
	for(i=0;i<n;i++){
		for(j=0;j<n-i;j++){
		if(arr[j] > arr[j+1]){
				temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
	for(i=0;i<n+2;i++){
		//printf("%I64d\n", arr[i]);
		if(i==0)
		temp1 = (float)((arr[i+1] - arr[i]));
		else if(i==n+1)
		temp1 = (float)((arr[i] - arr[i-1]));
		else{
		temp1 = (float)(((arr[i+1] - arr[i])/2.0));
		}
		//printf("%f\n", temp1);
		if (temp1 >= output)
		output = temp1;
	}

	printf("%f", output);

	return 0;
}


#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <float.h>

int main(){

	long long int m,temp=0;
	float output =0.0,temp1=0.0;
	int n,i,j;
	scanf("%d", &n);
	scanf("%I64d", &m);
	long long int arr[n+2];
	arr[0] = 0;
	arr[n+1] = m;
	for(i=1;i<n+1;i++){
		scanf("%I64d", &arr[i]);
	}
	for(i=0;i<n;i++){
		for(j=0;j<n-i;j++){
		if(arr[j] > arr[j+1]){
				temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
	for(i=0;i<n+2;i++){
		//printf("%I64d\n", arr[i]);
		if(i==0)
		temp1 = (float)(abs(arr[i+1] - arr[i]));
		if(i==n+1)
		temp1 = (float)(abs(arr[i] - arr[i-1]));
		temp1 = (float)(abs((arr[i+1] - arr[i])/2.0));
		//printf("%f\n", temp1);
		if (temp1 >= output)
		output = temp1;
	}

	printf("%f", output);

	return 0;
}


#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <float.h>

int main(){

	long long int m,temp=0;
	float output =0.0,temp1=0.0;
	int n,i,j;
	scanf("%d", &n);
	scanf("%I64d", &m);
	long long int arr[n+2];
	arr[0] = 0;
	arr[n+1] = m;
	for(i=1;i<n+1;i++){
		scanf("%I64d", &arr[i]);
	}
	for(i=0;i<n;i++){
		for(j=0;j<n-i;j++){
		if(arr[j] > arr[j+1]){
				temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
	for(i=0;i<n+2;i++){
		printf("%I64d\n", arr[i]);
		if(i==0)
		temp1 = (float)((arr[i+1] - arr[i]));
		if(i==n+1)
		temp1 = (float)((arr[i] - arr[i-1]));
		temp1 = (float)(((arr[i+1] - arr[i])/2.0));
		printf("%f\n", temp1);
		if (temp1 >= output)
		output = temp1;
	}

	printf("%f", output);

	return 0;
}


#include<stdio.h>

void sort(int a[], int k, int l);

int main()

{
    int i, n, a[250];

    float l, left, right, max, b;

    scanf("%d %f", &n, &l);

    b = left = right = 0;

    max = -1;

    for (i = 0; i < n; i++)

        scanf("%d", &a[i]);

    sort(a, 0, n - 1);

    for (i = 1; i < n; i++) {

        b = a[i] - a[i - 1];

        max = (b > max) ? b : max;
    }

    max /= 2;

    if (a[0] != 0) {

        left = a[0];

        max = (left > max) ? left : max;
    }

    if (a[n - 1] == l) {

        right = l - a[n - 1];

        max = (right > max) ? right : max;
    }

    printf("%.10f\n", max);

    return 0;
}

void sort(int a[], int k, int l) {

    int p, t, i, j;

    if (k < l) {

        p = k;

        i = k;

        j = l;

        while (i < j) {

            while (a[i] <= a[p] && i < l)

                i++;

            while (a[j] > a[p])

                j--;

            if (i < j) {

                t = a[i];

                a[i] = a[j];

                a[j] = t;
            }
        }

        t = a[p];

        a[p] = a[j];

        a[j] = t;

        sort(a, k, j - 1);

        sort(a, j + 1, l);
    }
}


#include<stdio.h>

void sort(long int a[], int k, int l);

int main()

{
    int i, n, a[1050];

    float l, left, right, max, b;

    scanf("%d %f", &n, &l);

    b = left = right = 0;

    max = -1;

    for (i = 0; i < n; i++)

        scanf("%d", &a[i]);

    sort(a, 0, n - 1);

    for (i = 1; i < n; i++) {

        b = a[i] - a[i - 1];

        max = (b > max) ? b : max;
    }

    max /= 2;

    left = a[0];

    max = (left > max) ? left : max;

    right = l - a[n - 1];

    max = (right > max) ? right : max;

    printf("%.10f\n", max);

    return 0;
}

void sort(long int a[], int k, int l) {

    int p, t, i, j;

    if (k < l) {

        p = k;

        i = k;

        j = l;

        while (i < j) {

            while (a[i] <= a[p] && i < l)

                i++;

            while (a[j] > a[p])

                j--;

            if (i < j) {

                t = a[i];

                a[i] = a[j];

                a[j] = t;
            }
        }

        t = a[p];

        a[p] = a[j];

        a[j] = t;

        sort(a, k, j - 1);

        sort(a, j + 1, l);
    }
}


#include<stdio.h>

void sort(long int a[], int k, int l);

int main()

{
    int i, n;

    long int a[250];

    float l, left, right, max, b;

    scanf("%d %f", &n, &l);

    b = left = right = 0;

    max = -1;

    for (i = 0; i < n; i++)

        scanf("%d", &a[i]);

    sort(a, 0, n - 1);

    for (i = 1; i < n; i++) {

        b = a[i] - a[i - 1];

        max = (b > max) ? b : max;
    }

    max /= 2;

    left = a[0];

    max = (left > max) ? left : max;

    right = l - a[n - 1];

    max = (right > max) ? right : max;

    printf("%.10f\n", max);

    return 0;
}

void sort(long int a[], int k, int l) {

    int p, t, i, j;

    if (k < l) {

        p = k;

        i = k;

        j = l;

        while (i < j) {

            while (a[i] <= a[p] && i < l)

                i++;

            while (a[j] > a[p])

                j--;

            if (i < j) {

                t = a[i];

                a[i] = a[j];

                a[j] = t;
            }
        }

        t = a[p];

        a[p] = a[j];

        a[j] = t;

        sort(a, k, j - 1);

        sort(a, j + 1, l);
    }
}


#include<stdio.h>

void sort(long int a[], int k, int l);

int main()

{
    int i, n, l, a[1050];

    float left, right, max, b;

    scanf("%d %d", &n, &l);

    b = left = right = max = 0;

    for (i = 0; i < n; i++)

        scanf("%d", &a[i]);

    sort(a, 0, n - 1);

    for (i = 1; i < n; i++) {

        b = a[i] - a[i - 1];

        max = (b > max) ? b : max;
    }

    max /= 2;

    left = a[0];

    max = (left > max) ? left : max;

    right = l - a[n - 1];

    max = (right > max) ? right : max;

    printf("%.10f\n", max);

    return 0;
}

void sort(long int a[], int k, int l) {

    int p, t, i, j;

    if (k < l) {

        p = k;

        i = k;

        j = l;

        while (i < j) {

            while (a[i] <= a[p] && i < l)

                i++;

            while (a[j] > a[p])

                j--;

            if (i < j) {

                t = a[i];

                a[i] = a[j];

                a[j] = t;
            }
        }

        t = a[p];

        a[p] = a[j];

        a[j] = t;

        sort(a, k, j - 1);

        sort(a, j + 1, l);
    }
}


#include<stdio.h>

void sort(long int a[], int k, int l);

int main()

{
    int i, n;

    long int a[250];

    float l, left, right, max, b;

    scanf("%d %f", &n, &l);

    b = left = right = 0;

    max = -1;

    for (i = 0; i < n; i++)

        scanf("%d", &a[i]);

    sort(a, 0, n - 1);

    for (i = 1; i < n; i++) {

        b = a[i] - a[i - 1];

        max = (b > max) ? b : max;
    }

    max /= 2;

    if (a[0] != 0) {

        left = a[0];

        max = (left > max) ? left : max;
    }

    if (a[n - 1] == l) {

        right = l - a[n - 1];

        max = (right > max) ? right : max;
    }

    printf("%.10f\n", max);

    return 0;
}

void sort(long int a[], int k, int l) {

    int p, t, i, j;

    if (k < l) {

        p = k;

        i = k;

        j = l;

        while (i < j) {

            while (a[i] <= a[p] && i < l)

                i++;

            while (a[j] > a[p])

                j--;

            if (i < j) {

                t = a[i];

                a[i] = a[j];

                a[j] = t;
            }
        }

        t = a[p];

        a[p] = a[j];

        a[j] = t;

        sort(a, k, j - 1);

        sort(a, j + 1, l);
    }
}


#include<stdio.h>

void sort(int a[], int k, int l);

int main()

{
    int i, n, a[1050];

    float l, left, right, max, b;

    scanf("%d %f", &n, &l);

    max = b = left = right = 0;

    for (i = 0; i < n; i++)

        scanf("%d", &a[i]);

    sort(a, 0, n - 1);

    for (i = 1; i < n; i++) {

        b = abs(a[i] - a[i - 1]);

        max = (b > max) ? b : max;
    }

    max = max / 2;

    left = a[0];

    right = l - a[n - 1];

    max = (left > max) ? left : max;

    right = (right > max) ? right : max;

    printf("%.10f\n", max);

    return 0;
}

void sort(int a[], int k, int l) {

    int p, t, i, j;

    if (k < l) {

        p = k;

        i = k;

        j = l;

        while (i < j) {

            while (a[i] <= a[p] && i < l)

                i++;

            while (a[j] > a[p])

                j--;

            if (i < j) {

                t = a[i];

                a[i] = a[j];

                a[j] = t;
            }
        }

        t = a[p];

        a[p] = a[j];

        a[j] = t;

        sort(a, k, j - 1);

        sort(a, j + 1, l);
    }
}


#include<stdio.h>
int main()
{
    int n,h,c,t;
    int sum,i,j,l;
    scanf("%d",&t);
    while(t>0)
    {   t--;
        sum=0;
        i=1;
        scanf("%d %d %d",&h,&c,&n);
        while(n-sum>1)
        {
            if(i%2==1)
            {
                sum=sum+h;
                sum=sum/i;

            }
            else
            {
                sum=sum+h;
                sum=sum/i;
            }
            i++;
        }
        printf("%d\n",i-1);
    }
}


#include<stdio.h>
int main()
{
    int n,h,c,t;
    int sum,i,j,l;
    scanf("%d",&t);
    while(t>0)
    {   t--;
        sum=0;
        i=1;
        scanf("%d %d %d",&h,&c,&n);
        while(n-sum<=1)
        {
            if(i%2==1)
            {
                sum=sum+h;
                sum=sum/i;

            }
            else
            {
                sum=sum+h;
                sum=sum/i;
            }
            i++;
        }
        printf("%d\n",i-1);
    }
}


#include<stdio.h>
int main()
{
    int n,h,c,t;
    int sum,i,j,l;
    scanf("%d",&t);
    while(t>0)
    {   t--;
        sum=0;
        i=1;
        scanf("%d %d %d",&h,&c,&n);
        while(n-sum>1)
        {
            if(i%2==1)
            {
                sum=sum+h;
                sum=sum/i;

            }
            else
            {
                sum=sum+c;
                sum=sum/i;
            }
            i++;
        }
        printf("%d\n",i-1);
    }
}


#include<stdio.h>
#include<string.h>
#include<stdlib.h>

char a[1005];
int main()
{
	int t,n,m,k,i,j,l,x,y,num=0,ans,all=0;
	long double pre,aft;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d%d",&n,&m,&k);
		if(2*k<=n+m)printf("2\n");
		else
		{
			ans=(n-k)/(2*k-n-m);
			pre=(long double)((long long)(n+m)*ans+n)/(2*ans+1);
			ans++;
			aft=(long double)((long long)(n+m)*ans+n)/(2*ans+1);
			pre-=k;
			aft-=k;
			pre=pre>0?pre:-pre;
			aft=aft>0?aft:-aft;
			if(pre>aft)printf("%d\n",2*ans+1);
			else printf("%d\n",2*ans-1);
		}
     }
}


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

int main()
{
    int t;
    // cin >> t;
    scanf("%d", &t);
    while (t--)
    {
        double h, c, tb;
        // cin >> h >> c >> tb;
        scanf("%lf %lf %lf", &h, &c, &tb);

        if (tb >= (2 * h + c) / 3)
        {
            //cout << min(abs(tb - h), abs(tb - (2 * h + c) / 3));
            double a = abs(h - tb);
            double b = abs(tb - (2 * h + c) / 3);
            if (a <= b)
            {
                // cout << 1 << endl;
                printf("1\n");
            }
            else
            {
                // cout << 3 << endl;
                printf("3\n");
            }

            continue;
        }
        else if (tb <= (h + c) / 2)
        {
            //cout << min(abs(tb - c), abs(tb - (h + c) / 2)) << endl;
            // cout << 2 << endl;
            printf("2\n");
            continue;
        }

        ll e = (h - tb) / (2 * tb - h - c);
        //e--;
        long double first = ((e + 1) * h + e * c) / (2 * e + 1);
        e++;
        long double second = ((e + 1) * h + e * c) / (2 * e + 1);

        //cout << "first   " << first << "  second  " << second << endl;

        if (first - tb <= tb - second)
        {
            e--;
            // cout << 2 * e + 1 << endl;
            printf("%lld\n", 2 * e + 1);
        }
        else
        {
            // cout << 2 * e + 1 << endl;
            printf("%lld\n", 2 * e + 1);
        }

        //     vector<double>
        //         v;
        // for (double i = e; 1; i++, count += 2)
        // {
        //     double a = ((i + 1) * h + i * c) / (2 * i + 1);
        //     v.push_back(a);
        //     cout << a << "  ";
        //     if (a < tb)
        //     {
        //         break;
        //     }
        // }
        // cout << endl;
        // int len = v.size();
        // if (abs(v[len - 1] - tb) < abs(tb - v[len - 2]))
        // {
        //     cout << count << endl;
        // }
        // else
        // {
        //     cout << count - 2 << endl;
        // }
    }
}


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

#include<stdio.h>
// #include <stdlib.h>

#define ll long long

double abs_(double a)
{
    if(a>=0)
    return a;
    else
    return -a;
}

int main()
{
    int t;
    // cin >> t;
    scanf("%d", &t);
    while (t--)
    {
        double h, c, tb;
        // cin >> h >> c >> tb;
        scanf("%lf %lf %lf", &h, &c, &tb);

        if (tb >= (2 * h + c) / 3)
        {
            //cout << min(abs(tb - h), abs(tb - (2 * h + c) / 3));
            double a = abs_(h - tb);
            double b = abs_(tb - (2 * h + c) / 3);
            if (a <= b)
            {
                // cout << 1 << endl;
                printf("1\n");
            }
            else
            {
                // cout << 3 << endl;
                printf("3\n");
            }

            continue;
        }
        else if (tb <= (h + c) / 2)
        {
            //cout << min(abs(tb - c), abs(tb - (h + c) / 2)) << endl;
            // cout << 2 << endl;
            printf("2\n");
            continue;
        }

        ll e = (h - tb) / (2 * tb - h - c);
        //e--;
        long double first = ((e + 1) * h + e * c) / (2 * e + 1);
        e++;
        long double second = ((e + 1) * h + e * c) / (2 * e + 1);

        //cout << "first   " << first << "  second  " << second << endl;

        if (first - tb <= tb - second)
        {
            e--;
            // cout << 2 * e + 1 << endl;
            printf("%lld\n", 2 * e + 1);
        }
        else
        {
            // cout << 2 * e + 1 << endl;
            printf("%lld\n", 2 * e + 1);
        }

    }
}


#include<stdio.h>
#include<string.h>
#include<stdlib.h>

char a[1005];
int main()
{
	int t,n,m,k,i,j,l,x,y,num=0,ans,all=0;
	long double pre,aft;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d%d",&n,&m,&k);
		if(2*k<=n+m)printf("2\n");
		else
		{
			ans=(n-k)/(2*k-n-m);
			pre=(long double)((n+m)*ans+n)/(2*ans+1);
			ans++;
			aft=(long double)((n+m)*ans+n)/(2*ans+1);
			pre-=k;
			aft-=k;
			pre=pre>0?pre:-pre;
			aft=aft>0?aft:-aft;
			if(pre>aft)printf("%d\n",2*ans+1);
			else if(2*ans-1<=0)printf("1\n");
			else printf("%d\n",2*ans-1);
		}
     }
}


#include<stdio.h>
#include<string.h>
#include<stdlib.h>

char a[1005];
int main()
{
	int t,n,m,k,i,j,l,x,y,num=0,ans,all=0;
	long double pre,aft;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d%d",&n,&m,&k);
		if(2*k<=n+m)printf("2\n");
		else
		{
			ans=(n-k)/(2*k-n-m);
			pre=(long double)((n+m)*ans+n)/(2*ans+1);
			ans++;
			aft=(long double)((n+m)*ans+n)/(2*ans+1);
			pre-=k;
			aft-=k;
			pre=pre>0?pre:-pre;
			aft=aft>0?aft:-aft;
			if(pre>aft)printf("%d\n",2*ans+1);
			else if(2*ans-1<=0)printf("1\n",2*ans-1);
			else printf("%d\n",2*ans-1);
		}
     }
}


#include<stdio.h>
#include<string.h>
#include<stdlib.h>

char a[1005];
int main()
{
	int t,n,m,k,i,j,l,x,y,num=0,ans,all=0;
	long double pre,aft;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d%d",&n,&m,&k);
		if(2*k<=n+m)printf("2\n");
		else
		{
			ans=(n-k)/(2*k-n-m);
			pre=(long double)((n+m)*ans+n)/(2*ans+1);
			ans++;
			aft=(long double)((n+m)*ans+n)/(2*ans+1);
			pre-=k;
			aft-=k;
			pre=pre>0?pre:-pre;
			aft=aft>0?aft:-aft;
			if(pre>aft)printf("%d\n",2*ans+1);
			else printf("%d\n",2*ans-1);
		}
     }
}


# include <stdio.h>
# include <math.h>
# include <string.h>
#define ll long long
#define db double

ll bin(db h, db c, db t)
{
    ll begin=1, end=1e7*c, mid;
    while(begin<=end)
    {
        mid=(begin+end)/2;
        if(((h+c-(c/mid))/(2-(1./mid)))==t)
            return mid;
        else if(((h+c-(c/mid))/(2-(1./mid)))>t)
            begin=mid+1;
        else
            end=mid-1;
    }
    if(abs(((h+c-(c/begin))/(2-(1./begin)))-t)==abs(((h+c-(c/end))/(2-(1./end)))-t))
        return end;
    else if(abs(((h+c-(c/begin))/(2-(1./begin)))-t)<abs(((h+c-(c/end))/(2-(1./end)))-t))
        return begin;
    else
        return end;
}

int main()
{
    ll tc;
    db h, c, t;
    scanf("%lld", &tc);
    while(tc--)
    {
        scanf("%lf %lf %lf", &h, &c, &t);
        if(h==t)
            puts("1");
        else if((h+c)/2>=t)
            puts("2");
        else
            printf("%lld\n", (2*bin(h, c, t))-1);
    }
    return 0;
}


# include <stdio.h>
# include <math.h>
# include <string.h>
#define ll long long
#define db double

ll bin(db h, db c, db t)
{
    ll begin=1, end=1e7*c, mid;
    while(begin<=end)
    {
        mid=(begin+end)/2;
        if(((h+c-(c/mid))/(2-(1./mid)))==t)
            return mid;
        else if(((h+c-(c/mid))/(2-(1./mid)))>t)
            begin=mid+1;
        else
            end=mid-1;
    }
    if(fabs(((h+c-(c/begin))/(2-(1./begin)))-t)==fabs(((h+c-(c/end))/(2-(1./end)))-t))
        return end;
    else if(fabs(((h+c-(c/begin))/(2-(1./begin)))-t)<fabs(((h+c-(c/end))/(2-(1./end)))-t))
        return begin;
    else
        return end;
}

int main()
{
    ll tc;
    db h, c, t;
    scanf("%lld", &tc);
    while(tc--)
    {
        scanf("%lf %lf %lf", &h, &c, &t);
        if(h==t)
            puts("1");
        else if((h+c)/2>=t)
            puts("2");
        else
            printf("%lld\n", (2*bin(h, c, t))-1);
    }
    return 0;
}


#include <stdio.h>
int main(){
	int n, i, j, flag = 1;
	float h, c, t, curr = 0, curr2 = 0;
	scanf("%d", &n);
	for(i = 0; i < n; i++){
		scanf("%f", &h);
		scanf("%f", &c);
		scanf("%f", &t);
		if(t == h){
			printf("1\n");
		}
		else if(t <= (c + h) / 2){
			printf("2\n");
		}
		else{
			j = 2;
			curr = j * h + (j - 1) * c;
			while(curr / (2 * j - 1) > t){
				j++;
				curr = j * h + (j - 1) * c;
				//printf("target : %f and j: %d\n", curr / (2 * j - 1), j);
			}
			j++;
			curr2 = j * h + (j - 1)	* c;
			if(t - curr2 / (2 * j - 1) < curr / (2 * j - 3) - t){
				//printf("target: %f and j: %d\n", curr2 / (2 * j - 1), j);
				printf("%d\n", 2 * j - 1);
			}
			else{
				printf("%d\n", 2 * j - 3);
			}

		}
	}
	return 0;
}


//░░░
// ░ anzim bin nasir
// ░
#include<stdio.h>
#include<math.h>
int main()
{
    long long int d,h,c,x;
    int t;
    float d1,d2;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lld%lld%lld",&h,&c,&x);
        if(h+c>=2*x)
        printf("2\n");

        else
        {
            d=(c-x)/(h+c-2*x);
            d1=fabs(x-(d*h+d*c-c)/(2.0000*d-1.0000));
            d2=fabs(x-(d*h+h+d*c)/(2.0000*d+1.0000));
            if(d1<=d2)
            printf("%lld\n",2*d-1);
            else
            printf("%lld\n",2*d+1);
        }
    }
    return 0;
}


//░░░
// ░ anzim bin nasir
// ░
#include<stdio.h>
#include<math.h>
int main()
{
    long long int d,h,c,x;
    int t;
    float d1,d2;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lld%lld%lld",&h,&c,&x);
        if(h+c>=2*x)
        printf("2\n");
        else if(h==x)
        printf("1\n");
        else
        {
            d=(c-x)/(h+c-2*x);
            d1=fabs(x-(d*h+d*c-c)/(2.0000*d-1.0000));
            d2=fabs(x-(d*h+h+d*c)/(2.0000*d+1.0000));
            if(d1<=d2)
            printf("%lld\n",2*d-1);
            else
            printf("%lld\n",2*d+1);
        }
    }
    return 0;
}


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

namespace Vovan_Training
{
    class _1359C
    {
        public static double F(int h, int c, int t, long x)
        {
            return (double)(x * h + (x - 1) * c) / (x + x - 1);
        }

        public static double Score(double a, double b)
        {
            return Math.Abs(a - b);
        }
        public static long Solve(int h, int c, int t)
        {
            double mean_value = (double)(h + c) / 2;
            long l = 1;
            long r = int.MaxValue;

            while (r - l > 1)
            {
                long m = (r + l) / 2;
                double val = F(h, c, t, m);
                if (val < t)
                    r = m;
                else
                    l = m;
            }
            double answer = F(h, c, t, l);
            long answer_ind = 2 * l - 1;

            double answer_val_r = F(h, c, t, r);

            if (Score(answer_val_r, t) < Score(answer, t))
            {
                answer_ind = 2 * r - 1;
                answer = answer_val_r;
            }

            if (Score(mean_value, t) < Score(answer, t))
                answer_ind = 2;

            return answer_ind;
        }
        static void Main(string[] args)
        {
            int T = int.Parse(Console.ReadLine());
            for (int test = 0; test < T; test++)
            {
                string[] row = Console.ReadLine().Split(' ');
                int h = int.Parse(row[0]);
                int c = int.Parse(row[1]);
                int t = int.Parse(row[2]);
                Console.WriteLine(Solve(h, c, t));
            }
        }
    }
}


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

namespace Vovan_Training
{
    class _1359C
    {
        public static decimal F(int h, int c, int t, long x)
        {
            return (decimal)(x * h + (x - 1) * c) / (x + x - 1);
        }

        public static decimal Score(decimal a, decimal b)
        {
            return Math.Abs(a - b);
        }
        public static long Solve(int h, int c, int t)
        {
            decimal mean_value = (decimal)(h + c) / 2;
            long l = 1;
            long r = int.MaxValue;

            while (r - l > 1)
            {
                long m = (r + l) / 2;
                decimal val = F(h, c, t, m);
                if (val < t)
                    r = m;
                else
                    l = m;
            }
            decimal answer = F(h, c, t, l);
            long answer_ind = 2 * l - 1;

            decimal answer_val_r = F(h, c, t, r);

            if (Score(answer_val_r, t) < Score(answer, t))
            {
                answer_ind = 2 * r - 1;
                answer = answer_val_r;
            }

            if (Score(mean_value, t) < Score(answer, t))
                answer_ind = 2;

            return answer_ind;
        }
        static void Main(string[] args)
        {
            int T = int.Parse(Console.ReadLine());
            for (int test = 0; test < T; test++)
            {
                string[] row = Console.ReadLine().Split(' ');
                int h = int.Parse(row[0]);
                int c = int.Parse(row[1]);
                int t = int.Parse(row[2]);
                Console.WriteLine(Solve(h, c, t));
            }
        }
    }
}


using System;
using System.Linq;
using System.Text;
using CompLib.Util;

public class Program
{

    public void Solve()
    {
        var sc = new Scanner();
        int t = sc.NextInt();
        var sb = new StringBuilder();
        for (int i = 0; i < t; i++)
        {
            sb.AppendLine(Q(sc.NextInt(), sc.NextInt(), sc.NextInt()));
        }
        Console.Write(sb);
    }

    string Q(int h, int c, int t)
    {
        // 温度hのお湯、　,温度cの冷水がある c < h

        // お湯を1カップ樽に注ぐ、冷水を1カップ樽に注ぐ、　繰り返し、

        // 温度をtに近づける 何杯必要か?

        // h,c

        // 1配ずつ混ぜる

        // h以上のとき
        if (t >= h) return "1";

        // med未満のとき

        // t <= (h+c)/2
        // 2t <= (h+c)
        if (2 * t <= (h + c)) return "2";

        // med < t < h

        // medを2n杯、hを1杯 温度

        int high = 0;

        int low = int.MaxValue / 2;

        while (low - high > 1)
        {
            int mid = (high + low) / 2;
            // mid*2杯 medを入れる

            if ((long)t * (mid * 2 + 1) <= (long)mid * (h + c) + h) high = mid;
            else low = mid;
        }

        double hh = (double)((long)high * (h + c) + h) / (high * 2 + 1);
        double ll = (double)((long)low * (h + c) + h) / (low * 2 + 1);

        if (hh - t < t - ll)
        {
            return (high * 2 + 1).ToString();
        }
        else
        {
            return (low * 2 + 1).ToString();
        }
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


using System;
using System.Linq;
using System.Text;
using CompLib.Util;

public class Program
{

    public void Solve()
    {
        var sc = new Scanner();
        int t = sc.NextInt();
        var sb = new StringBuilder();
        for (int i = 0; i < t; i++)
        {
            sb.AppendLine(Q(sc.NextInt(), sc.NextInt(), sc.NextInt()));
        }
        Console.Write(sb);
    }

    string Q(long h, long c, long t)
    {
        // 温度hのお湯、　,温度cの冷水がある c < h

        // お湯を1カップ樽に注ぐ、冷水を1カップ樽に注ぐ、　繰り返し、

        // 温度をtに近づける 何杯必要か?

        // 絶対値の差を最小にするには何杯必要か?

        if (t >= h) return "1";
        if (2 * t <= (h + c)) return "2";

        // i回 両方入れる
        // hを入れる

        // 単調減少

        long high = 0;
        long low = int.MaxValue;

        while (low - high > 1)
        {
            long mid = (high + low) / 2;

            // 温度
            // t < (2*mid*(h+c)/2 + h)/(2*mid+1)
            // t(2*mid+1) < (mid*(h+c)+h)

            if (t * (2 * mid + 1) < mid * (h + c) + h)
            {
                high = mid;
            }
            else
            {
                low = mid;
            }
        }

        // 温度差
        // (high*(h+c)+h)/(2*high + 1) - t < t - (low*(h+c)+h) / (2*low + 1)

        double hh = (double)(high * (h + c) + h) / (2 * high + 1) - t;
        double ll = t - (double)(low * (h + c) + h) / (2 * low + 1);

        if (hh < ll) return (2 * high + 1).ToString();
        else if (ll < t - (double)(h + c) / 2) return (2 * low + 1).ToString();
        return "2";
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


using System;
using System.Linq;
using System.Text;
using CompLib.Util;

public class Program
{

    public void Solve()
    {
        var sc = new Scanner();
        int t = sc.NextInt();
        var sb = new StringBuilder();
        for (int i = 0; i < t; i++)
        {
            sb.AppendLine(Q(sc.NextLong(), sc.NextLong(), sc.NextLong()));
        }

        Console.Write(sb);
    }

    string Q(long h, long c, long t)
    {
        long ans = 2;
        decimal diff = Math.Abs(t - (decimal)(h + c) / 2);

        // 両方混ぜる i回
        long high = 0;
        long low = int.MaxValue;

        while (low - high > 1)
        {
            long mid = (high + low) / 2;
            // mid回のときの温度

            decimal tmp = (decimal)(h * (mid + 1) + c * mid) / (2 * mid + 1);

            if (tmp > t) high = mid;
            else low = mid;
        }

        decimal hh = (decimal)(h * (high + 1) + c * high) / (2 * high + 1);
        if (Math.Abs(t - hh) < diff || (Math.Abs(t - hh) <= diff && high * 2 + 1 < ans))
        {
            diff = Math.Abs(t - hh);
            ans = high * 2 + 1;
        }
        decimal ll = (decimal)(h * (low + 1) + c * low) / (2 * low + 1);

        // Console.WriteLine($"{high} {low} {hh} {ll}");
        if (Math.Abs(t - ll) < diff || (Math.Abs(t - ll) <= diff && low * 2 + 1 < ans))
        {
            diff = Math.Abs(t - ll);
            ans = low * 2 + 1;
        }

        return ans.ToString();
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


using System;
using System.Linq;
using System.Text;
using CompLib.Util;

public class Program
{

    public void Solve()
    {
        var sc = new Scanner();
        int t = sc.NextInt();
        var sb = new StringBuilder();
        for (int i = 0; i < t; i++)
        {
            sb.AppendLine(Q(sc.NextInt(), sc.NextInt(), sc.NextInt()));
        }
        Console.Write(sb);
    }

    string Q(long h, long c, long t)
    {
        // 温度hのお湯、　,温度cの冷水がある c < h

        // お湯を1カップ樽に注ぐ、冷水を1カップ樽に注ぐ、　繰り返し、

        // 温度をtに近づける 何杯必要か?

        // 絶対値の差を最小にするには何杯必要か?

        if (t >= h) return "1";
        if (2 * t <= (h + c)) return "2";

        // i回 両方入れる
        // hを入れる

        // 単調減少

        long high = 0;
        long low = int.MaxValue;

        while (low - high > 1)
        {
            long mid = (high + low) / 2;

            // 温度
            // t < (2*mid*(h+c)/2 + h)/(2*mid+1)
            // t(2*mid+1) < (mid*(h+c)+h)

            if (t * (2 * mid + 1) < mid * (h + c) + h)
            {
                high = mid;
            }
            else
            {
                low = mid;
            }
        }

        // 温度差
        // (high*(h+c)+h)/(2*high + 1) - t < t - (low*(h+c)+h) / (2*low + 1)
        //

        decimal hh = (decimal)(high * (h + c) + h) / (2 * high + 1) - t;
        decimal ll = t - (decimal)(low * (h + c) + h) / (2 * low + 1);
        decimal tt = t - (decimal)(h + c) / 2;
        decimal hhh = h - t;
        // Console.WriteLine($"{t} {hh} {ll}");

        if (hhh <= tt && hhh <= hh && hhh <= ll) return "1";
        else if (tt <= hh && tt <= ll) return "2";
        else if (hh < ll) return (2 * high + 1).ToString();
        else return (2 * low + 1).ToString();
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


using System;
using System.Linq;
using System.Text;
using CompLib.Util;

public class Program
{

    public void Solve()
    {
        var sc = new Scanner();
        int t = sc.NextInt();
        var sb = new StringBuilder();
        for (int i = 0; i < t; i++)
        {
            sb.AppendLine(Q(sc.NextInt(), sc.NextInt(), sc.NextInt()));
        }
        Console.Write(sb);
    }

    string Q(long h, long c, long t)
    {
        // 温度hのお湯、　,温度cの冷水がある c < h

        // お湯を1カップ樽に注ぐ、冷水を1カップ樽に注ぐ、　繰り返し、

        // 温度をtに近づける 何杯必要か?

        // 絶対値の差を最小にするには何杯必要か?

        if (t >= h) return "1";
        if (2 * t <= (h + c)) return "2";

        // i回 両方入れる
        // hを入れる

        // 単調減少

        long high = 0;
        long low = (long)1e10;

        while (low - high > 1)
        {
            long mid = (high + low) / 2;

            // 温度
            // t < (2*mid*(h+c)/2 + h)/(2*mid+1)
            // t(2*mid+1) < (mid*(h+c)+h)

            if (t * (2 * mid + 1) < mid * (h + c) + h)
            {
                high = mid;
            }
            else
            {
                low = mid;
            }
        }

        // 温度差
        // (high*(h+c)+h)/(2*high + 1) - t < t - (low*(h+c)+h) / (2*low + 1)
        //

        decimal hh = (decimal)(high * (h + c) + h) / (2 * high + 1) - t;
        decimal ll = t - (decimal)(low * (h + c) + h) / (2 * low + 1);
        decimal tt = t - (decimal)(h + c) / 2;
        decimal hhh = h - t;
        // Console.WriteLine($"{t} {hh} {ll}");

        if (hhh <= tt && hhh <= hh && hhh <= ll) return "1";
        else if (tt <= hh && tt <= ll) return "2";
        else if (hh < ll) return (2 * high + 1).ToString();
        else return (2 * low + 1).ToString();
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


using System;
using System.Linq;
using System.Text;
using CompLib.Util;

public class Program
{

    public void Solve()
    {
        var sc = new Scanner();
        int t = sc.NextInt();
        var sb = new StringBuilder();
        for (int i = 0; i < t; i++)
        {
            sb.AppendLine(Q(sc.NextInt(), sc.NextInt(), sc.NextInt()));
        }
        Console.Write(sb);
    }

    string Q(long h, long c, long t)
    {
        // 温度hのお湯、　,温度cの冷水がある c < h

        // お湯を1カップ樽に注ぐ、冷水を1カップ樽に注ぐ、　繰り返し、

        // 温度をtに近づける 何杯必要か?

        // 絶対値の差を最小にするには何杯必要か?

        if (t >= h) return "1";
        if (2 * t <= (h + c)) return "2";

        // i回 両方入れる
        // hを入れる

        // 単調減少

        long high = 0;
        long low = int.MaxValue;

        while (low - high > 1)
        {
            long mid = (high + low) / 2;

            // 温度
            // t < (2*mid*(h+c)/2 + h)/(2*mid+1)
            // t(2*mid+1) < (mid*(h+c)+h)

            if (t * (2 * mid + 1) < mid * (h + c) + h)
            {
                high = mid;
            }
            else
            {
                low = mid;
            }
        }

        // 温度差
        // (high*(h+c)+h)/(2*high + 1) - t < t - (low*(h+c)+h) / (2*low + 1)
        //

        decimal hh = (decimal)(high * (h + c) + h) / (2 * high + 1) - t;
        decimal ll = t - (decimal)(low * (h + c) + h) / (2 * low + 1);

        if (hh < ll) return (2 * high + 1).ToString();
        else if (ll < t - (decimal)(h + c) / 2) return (2 * low + 1).ToString();
        return "2";
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


using System;
using System.Linq;
using System.Text;
using CompLib.Util;

public class Program
{

    public void Solve()
    {
        var sc = new Scanner();
        int t = sc.NextInt();
        var sb = new StringBuilder();
        for (int i = 0; i < t; i++)
        {
            sb.AppendLine(Q(sc.NextInt(), sc.NextInt(), sc.NextInt()));
        }
        Console.Write(sb);
    }

    string Q(long h, long c, long t)
    {
        // 温度hのお湯、　,温度cの冷水がある c < h

        // お湯を1カップ樽に注ぐ、冷水を1カップ樽に注ぐ、　繰り返し、

        // 温度をtに近づける 何杯必要か?

        // 絶対値の差を最小にするには何杯必要か?

        if (t >= h) return "1";
        if (2 * t <= (h + c)) return "2";

        // i回 両方入れる
        // hを入れる

        // 単調減少

        long high = 0;
        long low = int.MaxValue;

        while (low - high > 1)
        {
            long mid = (high + low) / 2;

            // 温度
            // t < (2*mid*(h+c)/2 + h)/(2*mid+1)
            // t(2*mid+1) < (mid*(h+c)+h)

            if (t * (2 * mid + 1) < mid * (h + c) + h)
            {
                high = mid;
            }
            else
            {
                low = mid;
            }
        }

        // 温度差
        // (high*(h+c)+h)/(2*high + 1) - t < t - (low*(h+c)+h) / (2*low + 1)
        //

        decimal hh = (decimal)(high * (h + c) + h) / (2 * high + 1) - t;
        decimal ll = t - (decimal)(low * (h + c) + h) / (2 * low + 1);
        decimal tt = t - (decimal)(h + c) / 2;
        // Console.WriteLine($"{t} {hh} {ll}");

        if (tt <= hh && tt <= ll) return "2";
        else if (hh < ll) return (2 * high + 1).ToString();
        else return (2 * low + 1).ToString();
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


using System;
using System.Linq;
using System.Text;
using CompLib.Util;

public class Program
{

    public void Solve()
    {
        var sc = new Scanner();
        int t = sc.NextInt();
        var sb = new StringBuilder();
        for (int i = 0; i < t; i++)
        {
            sb.AppendLine(Q(sc.NextLong(), sc.NextLong(), sc.NextLong()));
        }

        Console.Write(sb);
    }

    string Q(long h, long c, long t)
    {
        long ans = 2;
        decimal diff = Math.Abs(t - (decimal)(h + c) / 2);

        // 両方混ぜる i回
        long high = 0;
        long low = int.MaxValue;

        while (low - high > 1)
        {
            long mid = (high + low) / 2;
            // mid回のときの温度

            decimal tmp = (decimal)(h * (mid + 1) + c * mid) / (2 * mid + 1);

            if (tmp > t) high = mid;
            else low = mid;
        }

        decimal hh = (decimal)(h * (high + 1) + c * high) / (2 * high + 1);
        if (Math.Abs(t - hh) < diff || (Math.Abs(t - hh) <= diff && high * 2 + 1 < ans))
        {
            diff = Math.Abs(t - hh);
            ans = high * 2 + 1;
        }
        decimal ll = (decimal)(h * (low + 1) + c * low) / (2 * low + 1);

        Console.WriteLine($"{high} {low} {hh} {ll}");
        if (Math.Abs(t - ll) < diff || (Math.Abs(t - ll) <= diff && low * 2 + 1 < ans))
        {
            diff = Math.Abs(t - ll);
            ans = low * 2 + 1;
        }

        return ans.ToString();
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public Scanner sc;
    public void Solve()
    {
        var Q = sc.Int;
        while (Q-- > 0)
        {
            long H, C, T;
            sc.Make(out H, out C, out T);
            if ((H + C) / 2 >= T) { Console.WriteLine(2);continue; }
            int l = 0, r = (int)1e7;
            var min = new Frac();
            while (r - l > 1)
            {
                var m = (r + l) >> 1;
                Frac calc = ((m + 1) * H + m * C, 2 * m + 1);
                if ((calc - T).f > 0) l = m;
                else r = m;
            }
            var L = (T - new Frac((l + 1) * H + l * C, 2 * l + 1)).abs();
            var R = (T - new Frac((r + 1) * H + r * C, 2 * r + 1)).abs();
            if ((L - R).f <= 0) Console.WriteLine(2*l+1);
            else Console.WriteLine(2*r+1);
        }
    }
}

class Frac
{
    public long f, s;
    public void Normalize()
    {
        if (s < 0) { f = -f; s = -s; }
        var g = GCD(Abs(f), Abs(s));
        if (g == 0) { f = 0; s = 1; }
        else { f /= g; s /= g; }
    }
    public Frac(long f = 0, long s = 1) { this.f = f; this.s = s; Normalize(); }
    public Frac abs(){ f = Abs(f);return this; }
    public double ToDouble() => (double)f / s;
    public override string ToString() => f + "/" + s;
    public static bool operator ==(Frac a, Frac b)
    {
        return a.f * b.s == a.s * b.f;
    }
    public static bool operator !=(Frac a, Frac b) => !(a == b);
    public static Frac operator +(Frac a, Frac b)
    {
        Frac rt = new Frac();
        rt.f = a.f * b.s + a.s * b.f;
        rt.s = a.s * b.s;
        rt.Normalize();
        return rt;
    }
    public static Frac operator -(Frac a, Frac b)
    {
        Frac rt = new Frac();
        rt.f = a.f * b.s - a.s * b.f;
        rt.s = a.s * b.s;
        rt.Normalize();
        return rt;
    }
    public static Frac operator *(Frac a, Frac b)
    {
        Frac rt = new Frac();
        rt.f = a.f * b.f;
        rt.s = a.s * b.s;
        rt.Normalize();
        return rt;
    }
    public static Frac operator /(Frac a, Frac b)
    {
        Frac rt = new Frac();
        rt.f = a.f * b.s;
        rt.s = a.s * b.f;
        rt.Normalize();
        return rt;
    }
    public static implicit operator Frac(long a) => new Frac(a);
    public static implicit operator Frac((long f, long s) p) => new Frac(p.f, p.s);
    public long GCD(long num1, long num2)
        => num1 < num2 ? GCD(num2, num1) :
           num2 > 0 ? GCD(num2, num1 % num2) : num1;
}
#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var sol = new Solver() { sc = new Scanner() };
        //var th = new Thread(sol.Solve, 1 << 26);th.Start();th.Join();
        sol.Solve();
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int ArgMax<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }

    public static implicit operator Pair<T1,T2>((T1 f, T2 s) p) => new Pair<T1, T2>(p.f, p.s);
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }

    public static implicit operator Pair<T1, T2, T3>((T1 f, T2 s, T3 t) p) => new Pair<T1, T2, T3>(p.f, p.s, p.t);
}
#endregion


using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        var T = sc.Int;
        while (T-- > 0)
        {
            long h, c, t;
            sc.Make(out h, out c, out t);
            if ((h + c) / 2 >= t) { Console.WriteLine(2);continue; }
            /*for(int i = 0; i < 1000; i++)
            {
                var ca = (double)((i + 1) * h + i * c) / (2 * i + 1);
                Console.WriteLine(ca);
            }*/
            int l = 0, r = 1000000007;
            while (r - l > 1)
            {
                var m = (r + l) / 2;
                var ca = (double)((m + 1) * h + m * c) / (2 * m + 1);
                //Console.WriteLine(ca);
                if (ca == t) { r = m;break; }
                else if (ca > t) l = m;
                else r = m;
            }
            var d1 = Abs(t - (double)((l + 1) * h + l * c) / (2 * l + 1));
            var d2= Abs(t - (double)((r + 1) * h + r * c) / (2 * r + 1));
            if (d1 <= d2) Console.WriteLine(2*l+1);
            else Console.WriteLine(2*r+1);
        }
    }
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int MaxElement<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion


using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        var T = sc.Int;
        while (T-- > 0)
        {
            long h, c, t;
            sc.Make(out h, out c, out t);
            if ((double)(h + c) / 2 >= t) { Console.WriteLine(2);continue; }
            int l = 0, r = 1000000007;
            while (r - l > 1)
            {
                var m = (r + l) / 2;
                var ca = (double)((m + 1) * h + m * c) / (2 * m + 1);
                if (ca > t) l = m;
                else r = m;
            }
            var d1 = Abs(t - (double)((l + 1) * h + l * c) / (2 * l + 1));
            var d2= Abs(t - (double)((r + 1) * h + r * c) / (2 * r + 1));
            if (d1 < d2) Console.WriteLine(2*l+1);
            else Console.WriteLine(2*r+1);
        }
    }
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int MaxElement<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion


using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        var T = sc.Int;
        while (T-- > 0)
        {
            long h, c, t;
            sc.Make(out h, out c, out t);
            if ((h + c) / 2 >= t) { Console.WriteLine(2);continue; }
            /*for(int i = 0; i < 1000; i++)
            {
                var ca = (double)((i + 1) * h + i * c) / (2 * i + 1);
                Console.WriteLine(ca);
            }*/
            int l = 0, r = 1000000007;
            while (r - l > 1)
            {
                var m = (r + l) / 2;
                var ca = (double)((m + 1) * h + m * c) / (2 * m + 1);
                Console.WriteLine(ca);
                if (ca == t) { r = m;break; }
                else if (ca > t) l = m;
                else r = m;
            }
            var d1 = Abs(t - (double)((l + 1) * h + l * c) / (2 * l + 1));
            var d2= Abs(t - (double)((r + 1) * h + r * c) / (2 * r + 1));
            if (d1 <= d2) Console.WriteLine(2*l+1);
            else Console.WriteLine(2*r+1);
        }
    }
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int MaxElement<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion


using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int T = sc.Int;
        for (int _ = 0; _ < T; _++)
        {
            long h, c, t;
            sc.Multi(out h, out c, out t);
            c -= t;
            h -= t;
            t -= t;
            if (h + c >= t * 2) {
                Prt(2);
                continue;
            }
            long u = 0, l = M;
            while (u + 1 < l) {
                long m = (u + l) / 2;
                if (m * h + (m - 1) * c == t * (m * 2 - 1)) {
                    Prt(m * 2 - 1);
                    goto A;
                }
                if (m * h + (m - 1) * c > t * (m * 2 - 1)) {
                    u = m;
                }
                else {
                    l = m;
                }
            }
            double min = Math.Abs((h + c) / 2.0 - t);
            long ans = 2;
            for (long i = Math.Max(1, u - 5); i <= u + 5; i++)
            {
                double tt = (i * h + (i - 1) * c) / (double)(i * 2 - 1);
                if (min > Math.Abs(tt - t)) {
                    min = Math.Abs(tt - t);
                    ans = i * 2 - 1;
                }
            }
            Prt(ans);
            A: continue;
        }
    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    // public static readonly int M = 1000000007;
    public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        if (conds.Any(x => !x)) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
                                         .Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
    public static void Deconstruct<T>(this IList<T> v, out T a) {
        a = v[0];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b) {
        a = v[0]; b = v[1];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c) {
        a = v[0]; b = v[1]; c = v[2];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d) {
        a = v[0]; b = v[1]; c = v[2]; d = v[3];
    }
    public static void Deconstruct<T>(this IList<T> v, out T a, out T b, out T c, out T d, out T e) {
        a = v[0]; b = v[1]; c = v[2]; d = v[3]; e = v[4];
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
}