#include using namespace std; #define repl(i, l, r) for (int i = (l); i < (int)(r); ++i) #define rep(i, n) repl(i, 0, n) #define CST(x) cout << fixed << setprecision(x) #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() using ll = long long; constexpr ll MOD = 1000000007; constexpr int inf = 1e9 + 10; constexpr ll INF = (ll)4e18 + 10; constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0}; constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0}; template using MaxHeap = priority_queue; template using MinHeap = priority_queue, greater>; template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } template inline void yn(const T &a) { ((a) ? (cout << "Yes" << endl) : (cout << "No" << endl)); } template inline void YN(const T &a) { ((a) ? (cout << "YES" << endl) : (cout << "NO" << endl)); } double ch(string s) { s = s.substr(0, sz(s) - 3) + s.substr(sz(s) - 2); return (double)stoi(s) / 100.0l; } void solve() { string a, b, c; cin >> a >> b >> c; long double t = ch(a), m = ch(b), l = ch(c); long double res = (sqrtl(100.0l * m * m * t * t + 20.0l * m * l) - 10.0l * m * t) * 3.6l; int ans = res * 100.0l; CST(2) << (double)ans / 100.0l << endl; return; } int main() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); int t; cin >> t; while (t--) solve(); return 0; }