#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

inline double f(double x, int a, int b)
{
    return pow(x,a)*pow(log(x),b);
}

int main()
{
    int m;
    scanf(" %d", &m);
    while(m--)
    {
        int a,b;
        double t;
        scanf(" %d %d %lf", &a, &b, &t);

        double ans;
        if(a==0) ans = pow(exp(1), pow(t,1.0/b));
        else if(b==0) ans = pow(t,1.0/a);
        else
        {
            double l=1, r=10;
            if(a>=2 && b>=2) r=2.937;
            // int ct=0;
            while(r-l>1e-9)
            {
                // ++ct;
                double mid=(l+r)/2;
                if(f(mid,a,b)<t) l=mid;
                else r=mid;
            }
            ans = (l+r)/2;

            // printf("ct=%d\n", ct);
        }

        printf("%.12f\n", ans);
    }
    return 0;
}