#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>

using namespace std;
using ll=long long;

ll to_long_long(string X){
    int n=X.length();
    return stol(X.substr(0,n-3))*100+(X[n-2]-'0')*10+(X[n-1]-'0');
}

bool check(ll V, ll T, ll mu, ll L){return V*(25*V+18*T*mu)<=(ll)6480*mu*L;}

string answer(int V){
    int x=V/100, y=V%100;
    int a=y/10, b=V%10;
    return to_string(x)+"."+to_string(a)+to_string(b);
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    string t,m,l;
    ll T,mu,L;
    int V;

    int N; cin >> N;


    while (N){
        cin >> t >> m >> l;
        T=to_long_long(t);
        mu=to_long_long(m);
        L=to_long_long(l);

        V=0;
        while (check(V+1,T,mu,L)) {V++;}
        cout << answer(V) << "\n";

        N--;
    }

    return 0;
}