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

// #define getchar getchar_unlocked
// #define putchar putchar_unlocked

bool dot;
const int H = 17;
const int N = 1 << H;
const double L = 0;
const double R = log(10);
const double LL = -1e100;
const double RR = log(R);
const double dx = R / (1 << H);
const double logDX = log(R) - H * log(2);
const double log00001 = -4 * log(10);

double lg[N + 1];
bool prime[N + 1];
vector<int> bin[100001];
vector<int> gr[11][11];

int in() {
    int n, c;
    while ((c = getchar()) < '0') {
        assert(c != EOF);
    }
    n = c - '0';
    while ((c = getchar()) >= '0') {
        n = n * 10 + c - '0';
    }
    if (c == '.') {
        dot = true;
    }
    return n;
}

void out(double x) {
    static char buf[20];
    sprintf(buf, "%.9f", x);
    for (int i = 0; buf[i] != '\0'; i++) {
        putchar(buf[i]);
    }
    putchar('\n');
}

void sieve() {
    lg[0] = log(0);
    for (int i = 2; i <= N; i++) {
        if (!prime[i]) {
            double g = log(i);
            for (long long j = i; j < N; j *= i) {
                for (long long k = j; k < N; k += j) {
                    prime[k] = true;
                    lg[k] += g;
                }
            }
        }
    }
    for (int i = 0; i <= N; i++) {
        lg[i] += logDX;
    }
}

double elapsed() {
    static clock_t curr;
    clock_t prev = curr;
    curr = clock();
    return (double)(curr - prev) / CLOCKS_PER_SEC;
}

int main() {
    elapsed();
    int m = in();
    sieve();
    vector<char> a(m), b(m), d(m);
    vector<int> c(m);
    vector<int> cnt(100001);
    vector<vector<int>> cnt1(11, vector<int>(11));
    for (int i = 0; i < m; i++) {
        a[i] = in();
        b[i] = in();
        d[i] = in();
        c[i] = dot ? in() : 0;
        c[i] = d[i] * 10000 + c[i];
        cnt[c[i]]++;
        cnt1[a[i]][b[i]]++;
    }
    for (int i = 0; i <= 100000; i++) {
        bin[i].reserve(cnt[i]);
    }
    for (int i = 0; i <= 10; i++) {
        for (int j = 0; j <= 10; j++) {
            gr[i][j].reserve(cnt1[i][j]);
        }
    }
    for (int i = 0; i < m; i++) {
        bin[c[i]].push_back(i);
    }
    for (int i = 0; i <= 100000; i++) {
        for (int j : bin[i]) {
            gr[a[j]][b[j]].push_back(j);
        }
    }
    vector<double> ans(m);
    for (int a = 0; a <= 10; a++) {
        for (int b = 0; b <= 10; b++) {
            if (gr[a][b].empty()) {
                continue;
            }
            if (b == 0) {
                for (int i : gr[a][b]) {
                    const double logT = lg[c[i]] - logDX + log00001;
                    ans[i] = exp(logT / a);
                }
                continue;
            }
            if (a == 0) {
                for (int i : gr[a][b]) {
                    const double logT = lg[c[i]] - logDX + log00001;
                    ans[i] = exp(exp(logT / b));
                }
                continue;
            }
            int l = 1;
            for (int i : gr[a][b]) {
                const double logT = lg[c[i]] - logDX + log00001;
                while (l < N && a * l * dx + b * lg[l] < logT) {
                    l++;
                }
                int ll = l - 1;
                double s = (lg[ll + 1] - lg[ll]) / dx;
                ans[i] = exp((logT + s * b * ll * dx - lg[ll] * b) / (s * b + a));
            }
        }
    }
    for (int i = 0; i < m; i++) {
        out(ans[i]);
    }
}