#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

ll get_input(){
    string s; cin >> s;
    ll ans = 0;
    for(char c: s){
        if(c == '.') continue;
        ans = ans*10+(c-'0');
    }
    return ans;
}

string format_ll(ll x){
    string rem = to_string(x%100);
    ll v = x/100;
    if(rem.size() == 1) rem = "0"+rem;
    return to_string(v)+"."+rem;
}

void solve(){
    ll t = get_input();
    ll mu = get_input();
    ll l = get_input();
    auto ok = [&](ll v){
        return 360*v*mu*t + 500*v*v <= l*360*360*mu;
    };
    ll lv = 0, rv = 5100*360+1;
    while(rv-lv > 1){
        ll v = (lv+rv)/2;
        if(ok(v)) lv = v;
        else rv = v;
    }
    cout << format_ll(lv) << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) solve();
}