import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }




void main() {
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        const A = readInt();
        const B = readInt();
        const T = readReal();
        real ans;
        if (A == 0) {
          // (log x)^B = T
          ans = exp(T^^(1.0L/B));
        } else if (B == 0) {
          // x^A = T
          ans = T^^(1.0L/A);
        } else {
          // x^A (log x)^B = T
          //   A x^(A-1) (log x)^B + x^A B (log x)^(B-1) (1/x) = x^(A-1) (log x)^(B-1) (A log x + B)
          real x = 2.0;
          foreach (_; 0 .. 10) {
            x -= (x^^A * (log(x))^^B - T) / (x^^(A-1) * (log(x))^^(B-1) * (A * log(x) + B));
// writeln("  ",x);
          }
          ans = x;
        }
        writefln("%.10f", ans);
      }
    }
  } catch (EOFException e) {
  }
}