#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first	
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int M = 10000;
const db PI = acos(-1.0);
const db EPS = 1e-7;

void solve()
{
	db v, r, d;
	cin >> v >> r >> d;
	db ans = d / v;
	const db dt = ans / M;
	if (dt > 0)
	{
		db phiP = PI - v / (2 * r) * sqrt(3) * dt, phiPP = PI;
		FOR(i, 2, M + 1)
		{
			db t = i * dt;
			db siP = sin(phiP);
			db der = -v / (2 * r) * (sqrt(3 + siP * siP) - siP);
			db phi = phiPP + 2 * dt * der;
			db si = sin(phi), co = cos(phi);
			db a = d - 2 * r - v * t, b = a - 2 * r * co;
			if (abs(b) < EPS && phi < EPS)
			{
				ans = t;
				break;
			}
			if (b < -EPS)
				break;
			if (phi < PI / 2)
			{
				db l = sqrt(4 * r * r + a * a - 4 * r * a * cos(phi));
				db siBeta = 2 * r * si / l;
				assert(0 <= siBeta && siBeta < 1 + EPS);
				db beta = asin(min(1.0, siBeta));
				if (phi + beta <= PI / 2 && 2 * cos(phi + beta) >= cos(phi))
				{
					ans = min(ans, t + l / (2 * v));
					break;
				}
			}
			else if (phi < EPS)
			{
				ans = t + a / (2 * v);
				break;
			}
			phiPP = phiP;
			phiP = phi;
		}
	}
	cout << ans << "\n";
	//cerr << ans - 8.310579933902352 << "\n";
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(15);
	int t;
	cin >> t;
	while (t--)
		solve();
	return 0;
}