#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;
long double P,W,V,GX,GY;


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

pair<long double,long double> nex(pair<long double,long double> p) {
	long double x2=(1+V)*p.first-W*p.second;
	long 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<long double,long double> A[16],B[16];
		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++) {
			//_P("%d A:%lf %lf B:%lf %lf\n",i,A[i].first,A[i].second,B[i].first,B[i].second);
			long double dx=B[i].first-A[i].first;
			long double dy=B[i].second-A[i].second;
			//cout<<dx*dx+dy*dy<<endl;
			if(dx*dx+dy*dy<=P) {
				for(j=1;j<=T;j++) {
					if(j!=i) _P("0 0\n");
					else _P("%.12lf %.12lf\n",(double)dx,(double)dy);
				}
				break;
			}
		}
		assert(i<=T);
	}
	
}


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;
}