#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={1,0,-1,0,1,1,-1,-1}; const ll dx[8]={0,1,0,-1,1,-1,1,-1}; template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); ll m;cin >> m; using ld=double; CST(10); random_device rnd;mt19937 mt(rnd()); uniform_int_distribution<> rand1(0,10),rand2(1000,100000); while(m--){ ll a,b;cin >> a >> b; ld t;cin >> t; if(t>=1){ ld ok=30000,ng=1; rep(i,40){ ld mid=sqrt(ok*ng); if(pow(mid,a)*pow(log(mid),b)>=t)ok=mid; else ng=mid; } cout << ok << endl; } else{ ld ok=1,ng=0; rep(i,40){ ld mid=(ok+ng)/2; if(pow(mid,a)*pow(log(mid),b)>=t)ok=mid; else ng=mid; } cout << ok << endl; } } }