#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int T;
double P,W,V,GX,GY;


pair<double,double> pre(pair<double,double> p) {
	double d=(1+V)*(1+V)+W*W;
	double x2=(1+V)*p.first+W*p.second;
	double y2=-W*p.first+(1+V)*p.second;
	return {x2/d,y2/d};
}

pair<double,double> nex(pair<double,double> p) {
	double x2=(1+V)*p.first-W*p.second;
	double y2=W*p.first+(1+V)*p.second;
	return {x2,y2};
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	while(N--) {
		cin>>T>>P>>W>>V>>GX>>GY;
		
		pair<double,double> A[20],B[20];
		A[0]={1,0};
		B[T]={GX,GY};
		FOR(i,T) A[i+1]=nex(A[i]);
		for(i=T-1;i>=0;i--) B[i]=pre(B[i+1]);
		
		for(i=1;i<=T;i++) {
			double dx=B[i].first-A[i].first;
			double dy=B[i].second-A[i].second;
			if(dx*dx+dy*dy<P) {
				for(j=1;j<=T;j++) {
					if(j!=i) _P("0 0\n");
					else _P("%.12lf %.12lf\n",dx,dy);
				}
				break;
			}
		}
		if(i<=T) continue;
		
		double rs=hypot(A[0].first,A[0].second);
		double scale=sqrt((1+V)*(1+V)+W*W);
		double rt=hypot(GX,GY)/(rs*pow(scale,T));
		
		// scale first
		for(x=1;x<=T;x++) for(y=1;y<x;y++) {
			A[0]={1,0};
			double t=0;
			double cx,cy;
			for(i=1;i<=T;i++) {
				A[i]=nex(A[i-1]);
				if(i==y) {
					cx=A[i].first*rt-A[i].first;
					cy=A[i].second*rt-A[i].second;
					t+=cx*cx+cy*cy;
					A[i]={A[i].first*rt,A[i].second*rt};
				}
				if(i==x) {
					double dx=B[i].first-A[i].first;
					double dy=B[i].second-A[i].second;
					
					if(dx*dx+dy*dy+t<P) {
						for(i=1;i<=T;i++) {
							if(i==y) _P("%.12lf %.12lf\n",cx,cy);
							else if(i==x) _P("%.12lf %.12lf\n",dx,dy);
							else _P("0 0\n");
						}
						
						goto out;
					}
				}
			}
			
		}
		FOR(i,T) A[i+1]=nex(A[i]);
		for(x=1;x<=T;x++) for(y=1;y<x;y++) {
			B[T]={GX,GY};
			double t=0;
			double cx,cy;
			for(i=T;i>=1;i--) {
				if(i==x) {
					cx=B[i].first-B[i].first/rt;
					cy=B[i].second-B[i].second/rt;
					t+=cx*cx+cy*cy;
					B[i]={B[i].first/rt,B[i].second/rt};
				}
				if(i==y) {
					double dx=B[i].first-A[i].first;
					double dy=B[i].second-A[i].second;
					
					if(dx*dx+dy*dy+t<P) {
						for(i=1;i<=T;i++) {
							if(i==x) _P("%.12lf %.12lf\n",cx,cy);
							else if(i==y) _P("%.12lf %.12lf\n",dx,dy);
							else _P("0 0\n");
						}
						
						goto out;
					}
				}
				B[i-1]=pre(B[i]);
			}
		}
		assert(0);
		out:;
		
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}