#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
double q;
ll n,m,p;
double qpow(double q,ll x){
    if(x==0) return 1.0;
    if(x==1) return q;
    double tmp = qpow(q,x/2);
    tmp *= tmp;
    if(x%2) tmp*=q;
    return tmp;
}
double calc(ll x){
    return 1.0*(n*x+m)/(1.0-qpow(q,x));
}
void solve(){
    cin>>n>>m>>p;
    q = (1-p/10000.0);
    ll l=0,r=100000000;
    // for(int i=1;i<=10;i++){
    //     cout<<calc(i)<<" "<<i<<endl;
    // }
    while(r-l>5){
        ll lmid = l+(r-l)/3;
        ll rmid = r-(r-l)/3;
        double lans = calc(lmid);
        double rans = calc(rmid);
        if(lans <= rans) r=rmid-1;
        else l=lmid+1;
    }
    double res = calc(l);
    for(int i=l+1;i<=r;i++){
        res=min(res,calc(i));
    }
    cout<<res<<endl;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout<<fixed<<setprecision(10);
    int T=1;
    cin>>T;
    while(T--) solve();
    return 0;
}