#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> PII;
ld qpow(ld a, ll b)
{
    ld res = 1;
    assert(b >= 0);
    for (; b; b >>= 1)
    {
        if (b & 1)
            res = res * a;
        a = a * a;
    }
    return res;
}
#define maxn 200010
ld n, m, p;
ld check(int x)
{
    ld p1 = 1 - p;
    p1 = 1 - qpow(p1, x);
    p1 = 1 / p1 * (n * x + m);
    return p1;
}
const ld eps=1e-18;
void solve()
{

    scanf("%Lf%Lf%Lf",&n,&m,&p);
    p /= 10000;
    int l = 1, r = 1e12;
    while (l < r)
    {
        int k = (r - l) / 3;
        int mid1 = l + k;
        int mid2 = l + k * 2;
        if (check(mid1)-check(mid2) > eps)
        {
            l = mid1 +1;
        }
        else
        {
            r = mid2;
        }
    }
    //cout<<l<<endl;
    printf("%.6Lf\n",check(l));
}
int main()
{
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);
    int t = 1;
    scanf("%d",&t);
    while (t--)
        solve();
    return 0;
}