#include <bits/stdc++.h>

using namespace std;
using ld = double;
using P = pair<ld, ld>;

inline P mul(const P& p1, const P& p2)
{
    return make_pair(p1.first * p2.first - p1.second * p2.second, p1.second * p2.first + p1.first * p2.second);
}
P power(const P& p, const int n)
{
    if (n == 0) {
        return make_pair(1, 0);
    }
    if (n % 2 == 1) {
        return mul(power(p, n - 1), p);
    } else {
        const P prev = power(p, n / 2);
        return mul(prev, prev);
    }
}

int main()
{
    int N;
    cin >> N;
    for (int q = 0; q < N; q++) {
        int T;
        cin >> T;
        ld p, omega, v, gx, gy;
        cin >> p >> omega >> v >> gx >> gy;
        P A = make_pair(1 + v, omega);
        const P gp = power(A, T);
        gx -= gp.first;
        gy -= gp.second;
        const ld l = hypot(1 + v, omega);
        const ld F = (l == 1 ? T : (pow(l, 2 * T) - 1) / (l * l - 1));
        gx /= F;
        gy /= F;
        vector<P> ans(T, make_pair(gx, gy));
        for (int i = T - 2; i >= 0; i--) {
            ans[i] = make_pair(ans[i + 1].first * (1 + v) + ans[i + 1].second * omega, -ans[i + 1].first * omega + ans[i + 1].second * (1 + v));
        }
        for (int i = 0; i < T; i++) {
            cout << fixed << setprecision(50) << ans[i].first << " " << ans[i].second << endl;
        }
    }
    return 0;
}