#include <bits/stdc++.h>

using namespace std;

#define int128 __int128_t
#define int long long
#define PII pair<int, int>
#define PDD pair<double, double>
#define fi first    
#define se second
#define lowbit(x) x & -x
#define all(x) x.begin(), x.end()
#define INF 0x3f3f3f3f3f3f3f3f
#define ls(x) x << 1
#define rs(x) x << 1 | 1
#define ull unsigned long long
std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());

const int N = 1e6 + 10, M = 5e6 + 10, mod = 998244353;
const double eps = 1e-8;

int t, n, m, k;	
string sr;

void solve() {
	int p;
	cin >> n >> m >> p;
	auto cal = [&](int x) {
		int res = n * x + m;
		long double temp = 1 - 1.0 * p / 10000;
		long double te = 1 - pow(temp, x);
		long double ans = 1.0 * res / te;
		return ans;
	};
	if (p == 10000) {
		cout << 1.0 * (n + m) << "\n";
		return;
	}
	int l = 1, r = 1e9;
	while (r > l) {
		int mid1 = l + (r - l) / 3, mid2 = r - (r - l) / 3;
		if (cal(mid1) < cal(mid2)) r = mid2 - 1;
		else l = mid1 + 1;
	}
	long double res = 1.0;
	long double temp = 1.0 - 1.0 * p / 10000;
	res = 1.0 * (n * 1 + m) / (1 - temp);
	temp = pow(temp, l);
	res = min(res, 1.0 * (n * l + m) / (1 - temp));
	cout << res << "\n";
}

signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	cout.setf(ios::fixed), cout.precision(15);
	t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}