#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;
using vb=vector<bool>;using vs=vector<string>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){o<<'('<<p.fst<<", "<<p.snd<<')';return o;}

const int DEPTH1 = 300;
const int DEPTH2 = 200;

double ans[1000001];

double f(double x, int a, int b, double t, double lgx) {
  return pow(x, a) * pow(lgx, b) - t;
}

double g(double x, int a, int b, double lgx) {
  return pow(x, a-1) * pow(lgx, b-1) * a * lgx + b;
}

double POW(double x, int a) {
  if (a == 0) return 1;
  if (a == 1) return x;
  if (a == 2) return x * x;
  if (a == 3) return x * x * x;
  double x2 = x * x;
  if (a == 4) return x2 * x2;
  double x4 = x2 * x2;
  if (a == 5) return x4 * x;
  if (a == 6) return x4 * x2;
  if (a == 7) return x4 * x2 * x;
  if (a == 8) return x4 * x4;
  double x8 = x4 * x4;
  if (a == 9) return x8 * x;
  assert(0);
}

void Main() {
  int M_;
  scanf("%d\n", &M_);
  vector<vector<pair<double, int>>> Q(200);
  rep(i, M_) {
    int a_, b_;
    double t;
    scanf("%d%d%lf\n", &a_, &b_, &t);
    Q[a_ * 16 +  b_].emplace_back(t, i);
  }

  rep(a, 10) rep(b, 10) {
    int k_ = a * 16 + b;
    if (sz(Q[k_]) == 0) continue;
    vector<pair<double, int>> &vq = Q[k_];

    if (a == 0 || b == 0) {
      forr(ti, vq) {
        double t = ti.fst;
        int idx = ti.snd;
        if (a == 0) {
          t = pow(t, 1.0/b);
          ans[idx] = pow(M_E, t);
        }
        else ans[idx] = pow(t, 1.0/a);
      }
      continue;
    }

    int n = sz(vq);

    sort(all(vq), greater<pair<double, int>>());
    double x;

    {
      double t = vq[0].fst;
      int idx = vq[0].snd;

      x = t;
      rep(_, DEPTH1) {
        double lgx = log(x);
        double xa1 = POW(x, a - 1);
        double xa = xa1 * x;
        double lgxb1 = POW(lgx, b - 1);
        double lgxb = lgxb1 * lgx;

        double fx = xa * lgxb - t;
        double gx = xa1 * lgxb1 * a * lgx + b;

        x = x - fx / gx;
      }
      ans[idx] = x;
    }

    rep(i, 1, n) {
      double t = vq[i].fst;
      int idx = vq[i].snd;
      if (t == vq[i-1].fst) {
        ans[idx] = ans[vq[i-1].snd];
        continue;
      }

      rep(_, DEPTH2) {
        double lgx = log(x);
        double xa1 = POW(x, a - 1);
        double xa = xa1 * x;
        double lgxb1 = POW(lgx, b - 1);
        double lgxb = lgxb1 * lgx;

        double fx = xa * lgxb - t;
        double gx = xa1 * lgxb1 * a * lgx + b;

        x = x - fx / gx;
      }
      ans[idx] = x;
    }
  }

  rep(i, M_) {
    _p("%.12f\n", ans[i]);
  }
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  Main();
  return 0;
}