#include <bits/stdc++.h> using namespace std; #define rep(i,a,b) for(i=a;i<b;++i) #define repi(i,a,b) for(int i=a;i<b;++i) #define F first #define S second #define mp(a,b) make_pair(a,b) #define pii pair<int,int> #define ppi pair<pii,int> #define ppp pair<pii,pii> #define vi vector<int> #define sc(a) scanf("%d",&a) #define pb(a) push_back(a) #define pr(a) printf("%d",a) #define prn(a) printf("%d\n",a) #define scll(a) scanf("%lld",&a) #define prll(a) printf("%lld",a) #define prlln(a) printf("%lld\n",a) typedef long long LL; #define PI 3.14159265 int n,m; double findr2(double r1) { double a , b, c, d; a = sin(PI/n); b = cos(PI/n); //cout<<a*a-b*b-2*b<<endl; double x = (b+1 - a*sqrt(a*a+b*b+2*b))/((b+1)*(b+1) + a*a); double r2 = 1/(x) - 1; r2 *= r1; //cout<<r2<<endl; return r2; } double r0 = 1; double ri; int main() { // your code goes here int p; sc(p); while(p--) { int k; sc(k); sc(n);sc(m); double an = sin(PI/n); ri = r0 * an / (1-an); repi(i,1,m) { ri = findr2(ri); } printf("%d %.3lf %.3lf\n",k,ri,ri*(2*n + 2*PI)); } return 0; }