#include <bits/stdc++.h>
using namespace std;
double n, m, p, tmp, ans;
double calc(int k) {
	return (k * n + m) / (1 - pow(1 - p, k));
}
double get(double mid) {
	return pow(1 - p, mid) * (-tmp * n * mid - m * tmp + n);
}
void div1(double l, double r) {
	while (r - l > 1e-3) {
		double mid = (l + r) / 2;
		if (get(mid) < n) 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 (get(mid) < n) r = mid;
		else l = mid;
	}
	int k1 = floor(l), k2 = ceil(l);
	ans = min(ans, calc(k1));
	ans = min(ans, calc(k2));
}
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 = 1e4;
		while (r - l > 1e-3) {
			double lmid = l + (r - l) / 3;
			double rmid = r - (r - l) / 3;
			double lv = get(lmid);
			double rv = 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 (get(0) < n && n < get(l)) div1(0, l);
		if (get(1e9) < n && n < get(l)) div2(l, 1e9);
//		for (int i = 1; i <= 100; ++i) cerr << calc(i) << endl;
		printf("%.6lf\n", ans);
	}
	return 0;
}