#include <bits/stdc++.h>
using namespace std;
#define double long double
double n, m, p, tmp, ans, k, ww;
double down=0.9;
double calc(int k) {
	return (k * n + m) / (1 - pow(1 - p, k));
}
double log_get(double mid) {
//	return pow(1 - p, mid) * (-tmp * n * mid - m * tmp + n);
	return mid + log(-tmp * n * mid - m * tmp + n) / log(tmp);
}
void div1(double l, double r) {
	while (r - l > 1e-3) {
		double mid = (l + r) / 2;
		if (log_get(mid) < log(n) / log(tmp)) l = mid;
		else r = mid;
	}
	int k1 = floor(l), k2 = ceil(l);
	ans = min(ans, calc(k1));
	ans = min(ans, calc(k2));
}
void div2(double l, double r) {
	while (r - l > 1e-3) {
		double mid = (l + r) / 2;
		if (log_get(mid) < log(n) / log(tmp)) r = mid;
		else l = mid;
	}
	int k1 = floor(l), k2 = ceil(l);
	ans = min(ans, calc(k1));
	ans = min(ans, calc(k2));
}
void SA() {
	double t = 100;
	while (t > 1e-6) {
		double u = max((double)1, k + 1.0 * (rand() * 2 - RAND_MAX) / RAND_MAX*100000*t);
		double w = calc((int)u);
		double dt = ans - w;
		if (dt > 0 || exp(dt / t) * RAND_MAX>rand()) k = u, ww = w;
		if (w < ans) ans = w;
		t*=down;
	}
}
int main() {
	int T;
	cin >> T;
	while (T--) {
		scanf("%Lf%Lf%Lf", &n, &m, &p);
		p /= 10000;
		tmp = log(1 - p);
		/*double l = 0, r = 1e9;
		while (r - l > 1e-3) {
			double lmid = l + (r - l) / 3;
			double rmid = r - (r - l) / 3;
			double lv = log_get(lmid);
			double rv = log_get(rmid);
			if (fabs(lv - rv) < 1e-4) {
				l = lmid;
				r = rmid;
			} else if (lv < rv)
				l = lmid;
			else
				r = rmid;
		}
//		cerr << l << endl;
		ans = calc(1);
		if (log_get(0) < log(n) / log(tmp) && log(n) / log(tmp) < log_get(l)) div1(0, l);
		if (log_get(1e4) < log(n) / log(tmp) && log(n) / log(tmp) < log_get(l)) div2(l, 1e4);
//		for (int i = 1; i <= 100; ++i) cerr << calc(i) << endl;
		printf("%.6Lf\n", ans);*/
		ans = ww = calc(1);
		k = 5000;
		for (int i = 1; i <= 1; ++i) SA();
		printf("%.6Lf\n", ans);
	}
	return 0;
}