zoj3203

/*
三分法 
*/
#include <cstdio>
#include <algorithm>
using namespace std;
double H, h, D, mid;
const double  eps = 1e-10;
int sign(double a){
	return a < -eps ? -1 : (a > eps);
}
bool input(){
	scanf("%lf%lf%lf", &H, &h, &D);
	return true;
}
double getLen(double d){
	double x = d * h / (H - h);
	if(d <= mid){
		return x;
	}
	return D - d + h * (x - D + d) / x;
}
void solve(){
	double low, high, len;
	low = 0;
	high = D;
	mid = D - (D * h) / H;
	while(low+eps < high){
		len = (high - low) / 3;
		if(getLen(low+len) > getLen(low+len*2)){
			high = low+2*len;
		}else{
			low = low + len;
		}
	}
	double ans = getLen((low + high)/2);
	printf("%.3lf\n", ans);
}
int main(){
	//freopen("in.txt", "r", stdin);
	int t;
	scanf("%d", &t);
	while(t--){
		input();
		solve();
	}
	return 0;
}