#include<bits/stdc++.h>
#include<sstream>
#include<cassert>
#define fi first
#define se second
#define i128 __int128
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
const double eps=1e-6;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7,mod1=998244353;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}

int T,hackT;
int n,m,k;
int p;

db get(db x) {
	db res1=x*n+m;
	
	db res2=1-pow(1-p*1e-4,x);
	
	// printf("res1 = %.10f,res2 = %.10f\n",res1,res2);
	return res1/res2;
}

void solve() {
	n=read(),m=read(),p=read();
	
	db l=1,r=1e9;
	while(r-l>eps) {
		db lmid=l+(r-l)/3;
		db rmid=r-(r-l)/3;
		// printf("%.10f %.10f\n",rmid,lmid);
		// printf("%.10f %.10f\n",get(rmid),get(lmid));
		if(get(rmid)>=get(lmid)) r=rmid;
		else l=lmid;
	}
	
	double p1=floor(l),p2=ceil(l);
	printf("%.10lf\n",min(get(p1),get(p2)));
}   

int main() {
    // init();
    // stin();
	// ios::sync_with_stdio(false); 

    scanf("%d",&T);
    // T=1; 
    while(T--) hackT++,solve();
    
    return 0;       
}