/*
 * Copyright© 2024 Heratino & Nelofus. All rights reserved.
 * author: Heratino & Nelofus
 * Problem: 
 * Tag: 
 * Memory Limit: 
 * Time Limit: 
 * Source: 
 */

// Narcissus & どうか安寧な記憶を

#include <bits/stdc++.h>
using i64 = long long;
using f64 = double;

//{{{星光闪耀
template<typename Ta, typename Tb>
inline void chkmax(Ta &a, const Tb &b) {if (a < b)	a = b;}
template<typename Ta, typename Tb>
inline void chkmin(Ta &a, const Tb &b) {if (a > b)	a = b;}
//}}}

template<typename T>
T f_pow(T a, int k) {
	T base = 1;
	for (; k; k >>= 1, a = a * a)
		if (k & 1)
			base = base * a;
	return base;
}

void solve() {
	int n, m, p;
	std::cin >> n >> m >> p;
	f64 q = 1 - ((f64)p / 10000);

	auto val = [&](int k) -> f64 {
		// 1 - q^k
		// (k * n + m) / 1 - q^k;
		return ((f64)k * n + m) / (1.0 - f_pow(q, k));
	};
	int l = 1, r = 1e9 + 10;
	while (l < r - 5) {
		int ql = l + (r - l) / 3;
		int qr = r - (r - l) / 3;
		if (val(ql) < val(qr)) {
			r = qr;
		} else {
			l = ql;
		}
	}
	f64 ans = 1e18;
	for (int i = l; i <= r; i++)
		chkmin(ans, val(i));
	std::cout << std::format("{:.12f}\n", ans);
}

int main() {
#ifdef HeratinoNelofus
	freopen("input.txt", "r", stdin);
#endif
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int T;
	std::cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}