#include <bits/stdc++.h> using namespace std; #define rep(i,n) for(long long i = 0; i < (long long)(n); i++) #define pb push_back #define all(x) (x).begin(), (x).end() template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); } template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; } template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { if (!v.empty()) { o << '['; copy(v.begin(), v.end(), ostream_iterator<T>(o, ", ")); o << "\b\b]"; } return o; } using ll = long long; using vll = vector<ll>; using vi = vector<int>; typedef pair<ll, ll> P; static const double EPS = 1e-14; static const long long INF = 1e18; #define MAX_N 100005 int main(void) { int m; scanf("%d", &m); double maxerr = -INF; rep(i, m) { int a, b; scanf("%d%d", &a, &b); double t; scanf("%lf", &t); // cout << a << " " << b << " " << t << endl; if (!a) { // cout << "a=0" << endl; printf("%.12f\n", exp(pow(t, 1.0 / b))); continue; } if (!b) { // cout << "b=0" << endl; printf("%.12f\n", pow(t, 1.0 / a)); continue; } double rl = 1e-12; double rr = 11; rep(i, 40) { double m = (rl + rr) / 2; (pow(m, a) * pow(log(m), b) - t > 0) ? rr = m : rl = m; } double n = rl; printf("%.10f\n", n); // double err = pow(n, a) * pow(log(n), b) - t; // cout << err << endl; } return 0; }