#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int M;
int A,B;
double T,LT;

double border[11][11];

double score(double t) {
	double ret=1;
	int x=A;
	while(x--) ret*=t;
	t=log(t);
	x=B;
	while(x--) ret*=t;
	return ret;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	for(x=1;x<=10;x++) {
		for(y=2;y<=10;y+=2) {
			border[x][y]=exp(-y*1.0/x);
		}
	}
	
	cin>>M;
	FOR(i,M) {
		cin>>A>>B>>T;
		
		
		if(B==0) {
			_P("%.12lf\n",pow(T,1.0/A));
		}
		else if(B%2==1) {
			double L=1,R=1e9;
			while(R-L>5e-10) {
				double M=(L+R)/2;
				if(score(M)<T) L=M;
				else R=M;
			}
			_P("%.12lf\n",L);
		}
		else if(A==0) {
			_P("%.12lf\n",exp(-pow(T,-1.0/B)));
		}
		else {
			assert(0);
			double L,R;
			double TT=score(border[A][B]);
			if(T<=TT) {
				L=1e-9,R=border[A][B];
			}
			else {
				L=1,R=1e9;
			}
			
			while(R-L>5e-10) {
				double M=(L+R)/2;
				if(score(M)<LT) L=M;
				else R=M;
			}
			_P("%.12lf\n",L);
		}
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}