#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cmath>	
#include<climits>
using namespace std;

int n, m;
long double p;

long double f(int x)
{
	long double pp = 1.0 - (long double)pow(1.0 - p, x);
	int t = n * x + m;
	return (long double)t / pp;
}

void solve()
{
	cin >> n >> m >> p;
	p /= 10000;
	int l = 1, r = 0x3f3f3f3f;
	while (l < r)
	{
		int mid1 = l + (r - l) / 3;
		int mid2 = r - (r - l) / 3;
		if (f(mid1) < f(mid2))
		{
			r = mid2 - 1;
		}
		else
		{
			l = mid1 + 1;
		}
	}
	cout << fixed << setprecision(12) << f(l) << endl;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);

	int T;
	cin >> T;
	while (T--)
	{
		solve();
	}

	return 0;
}