#include <algorithm>
#include <cmath>
#include <cstdio>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;

const int N = 11;
const int B = 100001;
double memo[N][N][B];

/* 0.01 <= z <= 100 */
double lambert_W(double z) {
  double lo = 0.0, hi = 100;
  REP(i, 0, 45) {
    if (hi - lo <= 5e-12) { break; }
    double mid = (lo + hi) / 2;
    if (mid * exp(mid) <= z) {
      lo = mid;
    } else {
      hi = mid;
    }
  }
  return lo;
}


double solve(int a, int b, double t) {
  int idx = floor(t * 10000 + 0.5);
  if (memo[a][b][idx] >= 0) {
    return memo[a][b][idx];
  }
  double &ret = memo[a][b][idx];
  if (b == 0) {
    return ret=pow(t, 1.0 / a);
  }
  if (a == 0) {
    return ret=exp(pow(t, 1.0 / b));
  }
  double res = lambert_W(pow(t, 1.0 / b) * a / b); 
  return ret=exp(res * b / a);
}

int main(void){
  int m;
  scanf("%d", &m);
  REP(i, 0, N) {
    REP(j, 0, N) {
      REP(k, 0, B) {
	memo[i][j][k] = -1;
      }
    }
  }
  REP(i, 0, m) {
    int a, b;
    double t;
    scanf("%d%d%lf", &a, &b, &t);
    printf("%.15f\n", solve(a, b, t));
  }
}