#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const double eps = 1e-7;
long long n, m, p;

inline long long read() {
	long long x = 0, f = 1;
	char ch = getchar();
	while (!isdigit(ch)) {
		if (ch == '-') f = -1;
		ch = getchar();
	}
	while (isdigit(ch)) {
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	return x * f;
}

int main() {
	long long t = read();
	while (t--) {
		n = read(); m = read(); p = read();
		if (p == 1e4) printf("%lld\n", n + m);
		else {
			int N = 1;
			double P = (1e4 - p) / (1e4 * 1.0000000);
			double Mi = P, E;
			while (N <= 200) {
				E = (N * n + m) / (1 - Mi);
				double Mi2 = 1;
				bool flag = true;
				for (long long i = 1; i < N; i++) {
					Mi2 = Mi2 * p;
					if (Mi2 * (1 - P) * E - n < eps) {
						flag = false;
						break;
					}
				}
				if (flag && Mi * (1 - P) * E - n < eps) break;
				Mi *= P; N++;
			}
			printf("%.10lf\n", E);
		} 
	}
	return 0;
}