#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int m;
double a[1000010], b[1000010], t[1000010];

void solve() {
    for (int i = 0; i < m; i++) {
        if (a[i] < eps) {
            cout << pow(exp(1), pow(t[i], 1.0/b[i])) << endl;
        } else if (b[i] < eps) {
            cout << pow(t[i], 1.0/a[i]) << endl;
        } else {
            double lb = 0.0, ub = pow(exp(1), 11.0);
            a[i] /= b[i];
            t[i] = pow(t[i], 1.0/b[i]);
            for (int j = 0; j < 100; j++) {
                double mid = (lb + ub) / 2;
                if (pow(mid, a[i]) * log(mid) < t[i]) {
                    lb = mid;
                } else {
                    ub = mid;
                }
            }
            cout << ub << endl;
        }
    }
}

void input() {
    cin >> m;
    for (int i = 0; i < m; i++) cin >> a[i] >> b[i] >> t[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    solve();
}