#include <bits/stdc++.h>

using namespace std;

vector< pair< double, int > > qs[11][11];
double ans[1000000];

double F(int A, int B, double mid)
{
  return (pow(mid, A) * pow(log(mid), B));
}

int main()
{
  int M;
  scanf("%d", &M);
  for(int i = 0; i < M; i++) {
    int A, B;
    double T;
    scanf("%d %d %lf", &A, &B, &T);
    qs[A][B].emplace_back(T, i);
  }

  for(int i = 0; i < 11; i++) {
    for(int j = 0; j < 11; j++) {
      sort(begin(qs[i][j]), end(qs[i][j]));
      if(qs[i][j].empty()) continue;

      double low = 0, high = 1e5;
      for(int z = 0; z < 45; z++) {
        double mid = (low + high) * 0.5;
        if(F(i, j, mid) < qs[i][j][0].first) low = mid;
        else high = mid;
      }
      ans[qs[i][j][0].second] = low;

      if(qs[i][j].size() == 1) continue;

      high = 1e5;
      for(int z = 0; z < 45; z++) {
        double mid = (low + high) * 0.5;
        if(F(i, j, mid) < qs[i][j].back().first) low = mid;
        else high = mid;
      }
      ans[qs[i][j].back().second] = low;

      for(int x = 1; x < qs[i][j].size() - 1; x++) {
        auto &k = qs[i][j][x];
        low = ans[qs[i][j][x - 1].second];
        high = ans[qs[i][j].back().second];
        for(int z = 0; z < 10; z++) {
          double mid = (low + high) * 0.5;
          cout << F(i, j, mid) << endl;
          if(F(i, j, mid) < k.first) low = mid;
          else high = mid;
        }
        ans[k.second] = low;
      }
    }
  }
  for(int i = 0; i < M; i++) {
    printf("%.12lf\n", ans[i]);
  }
}