#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
double solve(int a, int b, double t){
    if(b==0) return pow(t, 1.0/a);
    if(a==0) return exp(pow(t, 1.0/b));
    double x=2;
    for(int i=0; i<20; i++){
        double y=log(x), xp=pow(x, 1-a), yp=pow(y, 1-b);
        double z=(x*y-t*xp*yp)/(a*y+b);
        x-=z;
    }
    return x;
}
int main()
{
	int m;
    scanf("%d", &m);
    for(int i=0; i<m; i++){
        int a, b; double t;
        scanf("%d %d %lf", &a, &b, &t);
        printf("%.10lf\n", solve(a, b, t));
    }
	return 0;
}