#include <iostream>
#include <cstdio>
#include <utility>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cmath>
#include <set>

#define test
#ifndef test
    freopen("in.in", stdin);
#endif

#define rint register int
#define ll long long
#define P pair<int, int> 
const int N = 2e5+5;

using namespace std;
int n, m, p;
long double qpow(long double a, int x){
    long double ans = 1;
    while(x){
        if(x&1) ans*=a;
        a*=a;
        x>>=1;
    }
    return ans;
}
long double val(int k){
    long double ans = 1 - qpow(1-(long double)p*0.0001, k);
    ans /= (n * k + m);
    return ans;
}

void solution(){
    scanf("%d%d%d", &n, &m, &p);
    int l = 0, r = 2e9, eps = 1, lm, rm, mid;
    while(r - l > eps){
        mid = (l + r) / 2;
        lm = mid - eps;
        rm = mid + eps;
        if(val(lm) < val(rm)) l = mid;
        else r = mid;
    }

    printf("%.10lf", (double)(1/val(l)));
}

int main(){
    test
    int t = 1;
    scanf("%d", &t);
    while (t--){
        solution();
        if(t) printf("\n");
    }
}