#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long int lli;
typedef pair<lli, lli> P;
lli MOD = 1000000007;
double dp[11][11][23000];
//dp[a][b][n];
void fill()
{
    for (int n = 1; n < 23000; n++) {
        dp[0][0][n] = 1.0;
        rep(i, 10) rep(j, 10)
        {
            double l = (double)(n);
            dp[i + 1][j][n] = dp[i][j][n] * l;
            dp[i][j + 1][n] = dp[i][j][n] * log(l);
        }
    }
}
struct tmp {
    double operator()(const int a, const int b, const double c)
    {
        double ans = 1;
        rep(i, a) ans *= c;
        rep(i, b) ans *= log(c);
        return ans;
    }
} f;

int main()
{
    int m;
    cin >> m;
    int a, b;
    double c;
    fill();
    rep(i, m)
    {
        scanf("%d %d %lf", &a, &b, &c);
        int up = 23000, low = 0;
        while (up - low > 1) {
            int mid = (up + low) / 2;
            if (dp[a][b][mid] < c) {
                low = mid;
            } else {
                up = mid;
            }
        }
        double upd = (double)up;
        double lowd = (double)low;
        int cnt = 0;
        while (upd - lowd > 1e-10 && cnt < 50) {
            cnt++;
            double midd = (upd + lowd) / 2;
            if (f(a, b, midd) < c) {
                lowd = midd;
            } else {
                upd = midd;
            }
        }
        printf("%.15f\n", upd);
    }
}