#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e6+5,M=3e5+5,K=(1<<15)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,p;
db calc(int x){
	return 1/(1-pow(1-p/1e4,x))*(1ll*n*x+m);
}
void Solve(){
	int i,j;scanf("%d%d%d",&n,&m,&p);
	int l=1,r=1e5;
	db ans=1e18;
	while(l+2<r){
		int m1=(l*2+r)/3,m2=(l+2*r)/3;
		db w1=calc(m1);
		db w2=calc(m2);
		ans=min(ans,min(w1,w2));
		if(w1<w2) r=m2;else l=m1;
	}
	for(int i=l;i<=r;i++) ans=min(ans,calc(i));
	printf("%.9lf\n",ans);
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}