#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <queue>
#include <map>
#include <vector>
#include <unordered_map>
#include <set>
#include <cmath>
#include <unordered_set>
#include <iomanip>
#include <stdio.h>
#include <queue>
#define int long long
//#define int __int128
using namespace std;
#define endl '\n'
#define F first
#define S second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
const int N = 1e6 + 10;
const int mod = 1e9+9;
const int M = 8;
const int MAXN = 1e6;

//读入
inline int read() {
	int x = 0, f = 1; char ch = getchar();
	while (ch > '9' || ch < '0') { if (ch == '-')f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
	return x * f;
}
//打印
inline void write(int x) {
	if (x < 0) { putchar('-'); x = -x; }
	if (x > 9)write(x / 10);
	putchar(x % 10 + '0');
}

ll ksm(ll m,ll k,ll mod)
{
	ll ans=1;
	ll t=m;//通过t来预处理m的二次方幂
	while(k){
		if(k&1) ans=ans*t%mod;//判断k的二进制末位是否为1,相当于k%=2
		t=t*t%mod;//预处理
		k>>=1;//将k的二进制位右移相当于k/=2
	}
	return ans;
}

double ksm_f(double m,ll k)
{
	double ans=1.0;
	double t=m;//通过t来预处理m的二次方幂
	while(k){
		if(k&1) ans=ans*t;//判断k的二进制末位是否为1,相当于k%=2
		t=t*t;//预处理
		k>>=1;//将k的二进制位右移相当于k/=2
	}
	return ans;
}

int n,m,k;
double q,p;

double check(int x)
{
	return (1.0*x*n+m)/(1.0-ksm_f(q,x));
}

void solve()
{
	//cin>>n>>m>>k;
	scanf("%lld%lld%lld",&n,&m,&k);
	p=1.0*(double)k/10000.0;
	q=1-p;
	int l=1,r=1000000;
	double la,ra;
	while(l<r){
		int mid1=l+(r-l)/3;
		int mid2=r-(r-l)/3;
		la=check(mid1),ra=check(mid2);
		if(la<=ra){
			r=mid2-1;
		}
		else{
			l=mid1+1;
		}
	}
	printf("%.12f\n",min(la,ra));
}

signed main()
{
	std::ios::sync_with_stdio(false);//
	std::cin.tie(0);
	int tc;	
	//fac_init(mod);
	tc = 1;
	//cin >> tc;
	scanf("%lld",&tc);
	while (tc--) {
		solve();
	}
	return 0;
}