#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <tuple>
#include <queue>
#include <stack>
#include <functional>
#include <utility>
#include <complex>
#include <bitset>
#include <numeric>
#include <random>
using namespace std;

#define REP(i,n) for(int (i)=0; (i)<(n) ;++(i))
#define REPN(i,a,n) FOR((i),(a),(a)+(n))
#define FOR(i,a,b) for(int (i)=(a); (i)<(b) ;++(i))
#define PB push_back
#define MP make_pair
#define SE second
#define FI first
#define DBG(a) cerr<<(a)<<endl;
#define dump(a) cerr<<#a <<' '<< a <<endl;
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;  typedef pair<LL, LL> PLL; typedef vector<LL> VLL;
typedef pair<int,int>PI; typedef vector<int> VI;
const LL LINF=334ll<<53; const int INF=15<<26; const LL MOD=1E9+7;
double eps=1e-13;
double solve(int a, int b, double t){
    double l=0.1,u=22222.0;
    while(u-l>5e-10 or (u-l)/l>5e-10){
        double m=(l+u)/2.0;
        if(pow(m,(double)a)*pow(log(m),(double)b)<t-eps){
            l=m;
        }else{
            u=m;
        }
    }
    return (l+u)/2.0;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(11);
    double pre[11][11][1002];
    REP(i,11)REP(j,11)FOR(k,10,1002)pre[i][j][k]=solve(i,j,k*0.01);
    int m,a,b,pt;
    cin >> m;
    double t,l,u,mid;
    REP(i,m){
        cin  >> a >> b >> t;
        pt=floor((t+0.00005)*100);
        l=pre[a][b][pt],u=pre[a][b][pt+1];
        if(a==0 and b==1){
            cout << exp(t)<<endl;
            continue;
        }
        while(u-l>15e-9 or (u-l)/l>15e-9){
            mid=(l+u)/2.0;
            if(pow(mid,(double)a)*pow(log(mid),(double)b)<t-eps){
                l=mid;
            }else{
                u=mid;
            }
        }
        cout << (l+u)/2.0<<endl;
    }

    return 0;
}